Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/308386.308431acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article
Free access

Independence-reducible database schemes

Published: 01 March 1988 Publication History
  • Get Citation Alerts
  • Abstract

    A class of cover embedding database schemes, called independence-reducible, is proposed and is proven to be bounded and algebraic-maintainable, and therefore is highly desirable with respect to query answering and constraint enforcement. This class of schemes is shown to properly contain a superset of all previously known classes of cover embedding BCNF database schemes which are bounded (and constant-time-maintainable). An efficient algorithm is found which recognizes exactly this class of database schemes. Independence-reducible database schemes properly contain a class of constant-time-maintainable database schemes and a condition which characterizes this class of schemes is found, this condition can be tested efficiently. Throughout, it is assumed that a cover of the functional dependencies is embedded in the database scheme in the form of key dependencies.

    References

    [1]
    Aho, A V., Beers, C., Ullman, J.D "The Them'y of Jotm m Relational Databa.u~" ACM TODS 4, 3 (1979), plx 207-314
    [2]
    Aho, A.V., Saglv, Y., Ullman, J.D., "Eqmvalence of Relatmnal Expresmom," SIAM J of Comput mg 8.2 (1979), pp. 218-246,
    [3]
    Atzem P., Chart, F.P.F., "Efhclent Query Answermg m the Reprtsentatsve Instance Approach," Proc ACM PODS, 1985, pp. 181-15&
    [4]
    Chan, F.PJ:., "Optunal Computauon of Total Projections with Umom of Stmple Chase Join Expresmons," Proc ACM $1GMOD 1984, pp. 149-163.
    [5]
    Chan, E.PF., Atzem, P., "Connectaon-trap-frec Database Schemes," submttted to pubhtatton, 198(x
    [6]
    Chart, F~.F, Hernlndez, H.J, "On the I)emrabsltry of T-acychc BCNF database schemes," to appear m Theoretwal Computer Science, 198Z
    [7]
    Chart, E.P.F., Hern~mdez, H.J~ "On Dcmgmng Database Schemes Bounded and C.mmtant-ttm~ mamtamable wlth re~-x-t to Functtonal lkpendenctes," Pro(: ACM PODS 1987, pix 48-57.
    [8]
    Chart, E.P.F., Hernlndez, H J., "Testing Unboundedness of Database Schemes and Functtorml Dependenoes," submttted to pubhcatmn, 1986.
    [9]
    Chart, F.P F., Mendelzon, A.O., "Answ~mg Queries on the Embedded-complete Database Schemes," Journa/ of ACM M 2 (1987), pp. 349 37.5
    [10]
    Fagm R, "Hvpergraphs and Relattonal Databa~ Schemes," Journal of ACM 30"J (198J), pp. 514 550
    [11]
    Graham, M.H, Mendelzon, A.O, "The Power of Canomcal Queries7 unpublmhed man--apt, 1983.
    [12]
    Graham, M H., Mendelzon, A.O Vardt, MY, "Nouom of Dependency Ssttsfactton," Journal of ACM 33 1 (1986), pp 105 129
    [13]
    Graham, M.H~ Wang, K. "Constant Ttme Maintenance or the Triumph of the fd," Proc ACM PODS 1986, pp. 202 216.
    [14]
    Graham, M H, YannakakLs, M., "Independent Datab~ Schemas," Journal of Computer and System Scwnces 28 1 (1984), pp 121-141
    [15]
    Honeyman, P, "Extension Joins" Proc VLDB 1980, pp 239 244
    [16]
    Honeyman, P., "Testing Sat tsfacu on of Functtona} Dependenctes," Journal of ACM 29 3 (1982), plx 668-677
    [17]
    }to, M, Iv, asakL M., Kasamt, T., "Some Results on the Representattve Instance m Relational Data hasek" SlAM J of Cornpmmg 14 2 (1985), pp 334-354
    [18]
    Maler, D, The Theor~ of RelaLmnal Databoses Computer Soence Press 1983.
    [19]
    Mater, D, Mendelzon, A O, Sagn Y., "Te~tmg lmpllcattons of Data Depcndenctes7 ACM TODS 4 4 (1979), pp 455-469
    [20]
    Mater, D. R~tem, D, Warren, D.S., "Win dox~ s Functlom" Advances m Coml~mg Research VoZ 3, JAI Press, 1986, pp 213 246.
    [21]
    Malcr, D, Ullman JD Vardl, MY. "On tht Foundations of the Umversal Relatmn Model" ACM TODS 9 2 (198J), pp 283-308.
    [22]
    Mendelzon, A.O, "Database States and Thetr Tableaux," ACM TODS 9 2 (1984), pp. 264-282.
    [23]
    Sagw, Y, "Can We U~ The Umversa} Instanoe Assumption Without Using Nulls"~' Proc ACM SIGMOD 1981, pp. 108-120
    [24]
    Sagls, Y, "A Characterxzauon of Globally Conrdstent Databases and Their Correct Access Paths," ACM TODS 8 2 (1983), pp. 266 286.
    [25]
    Sag~ Y, "Evaluauon o! Queries m Independent Database Schemes," submttted to pubhcatlon, 1984
    [26]
    Saglv, Y, "On Bounded Database Schemes and Bounded Horn-Clause Programs," to appear m SIAM J of Computing
    [27]
    Ullman, J.D., Pnnclples of Dazabase Systems, Computer Sctence Press, Potomac, 1982.
    [28]
    Vassfltou Y, "A Formal Treatment of Imperfect Information m Data Management," CSRG TR- 123, No~ 1980, Umverslty of Toronto.
    [29]
    Yannakakls, M, "Algorithms for Acychc Database S heroes," Proc VLDB 1981, pp. 82-94

    Cited By

    View all

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODS '88: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
    March 1988
    352 pages
    ISBN:0897912632
    DOI:10.1145/308386
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 March 1988

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    SIGMOD/PODS05

    Acceptance Rates

    Overall Acceptance Rate 642 of 2,707 submissions, 24%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)15
    • Downloads (Last 6 weeks)4
    Reflects downloads up to 10 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2005)Incremental database design revisitedAdvances in Computing and Information — ICCI '9110.1007/3-540-54029-6_171(219-230)Online publication date: 1-Jun-2005
    • (1992)Constant-time maintainabilityACM Transactions on Database Systems10.1145/128903.12890417:2(201-246)Online publication date: 1-Jun-1992
    • (1991)Constant-time-maintainable BCNF database schemesACM Transactions on Database Systems10.1145/115302.11530116:4(571-599)Online publication date: 1-Dec-1991
    • (1991)Independent database schemes under functional and inclusion dependenciesActa Informatica10.1007/BF0126165628:8(777-799)Online publication date: 1-Aug-1991
    • (1990)Polynomial time designs toward both BCNF and efficient data manipulationACM SIGMOD Record10.1145/93605.9362419:2(74-83)Online publication date: 1-May-1990
    • (1990)Polynomial time designs toward both BCNF and efficient data manipulationProceedings of the 1990 ACM SIGMOD international conference on Management of data10.1145/93597.93624(74-83)Online publication date: 1-May-1990
    • (1989)Can constant-time-maintainability be more practical?Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems10.1145/73721.73733(120-127)Online publication date: 29-Mar-1989
    • (1988)A characterization of constant-time maintainability for BCNF database schemesACM SIGMOD Record10.1145/971701.5022817:3(209-217)Online publication date: 1-Jun-1988
    • (1988)A characterization of constant-time maintainability for BCNF database schemesProceedings of the 1988 ACM SIGMOD international conference on Management of data10.1145/50202.50228(209-217)Online publication date: 1-Jun-1988

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media