article

Free access

A characterization of constant-time maintainability for BCNF database schemes

Authors:

Héctor J. Hernández,

Edward P. F. ChanAuthors Info & Claims

ACM SIGMOD Record, Volume 17, Issue 3

Pages 209 - 217

https://doi.org/10.1145/971701.50228

Published: 01 June 1988 Publication History

Abstract

The maintenance problem (for database states) of a database scheme R with respect to a set of functional dependencies F is the following decision problem. Let r be a consistent state of R with respect to F and assume we insert a tuple t into r_p ε r. Is r ∪ {t} a consistent state of R with respect to F? R is said to be constant-time-maintainable with respect to F if there is an algorithm that solves the maintenance problem of R with respect to F in time independent of the state size.

A characterization of constant-time-maintainability for the class of BCNF database schemes is given. An efficient algorithm that tests this characterization is shown, as well as an algorithm for solving the maintenance problem in time independent of the state size. It is also proven that constant-time-maintainable BCNF database schemes are bounded. In particular, it is shown that total projections of the representative instance can be computed via unions of projections of extension joins. Throughout we assume that database schemes are cover embedding and BCNF, and that functional dependencies are given in the form of key dependencies.

References

[1]

Aho, A V, Beeri, C, Ullman, J D "The Theory of Joins m Relational Databases," ACM TODS 4, 3 (1979), pp 297-314

Digital Library

[2]

Atzem, P, Chan, E P F, "Efficient Query Answering in the Representative instance Approach," Proc A CM PODS, 1985, pp 181-188

Digital Library

[3]

Aho, A V, Saglv, Y, Ullman, J D, "Equivalence of Relational Expressions," SlAM J on Computing 8 2 (1979), pp 218-246

[4]

Beerl, C, Bernstem, P A "Computational Problems Related to the Design of Normal Form Relational Schemas," A CM TODS 4, 1 (1979), pp 30-59

Digital Library

[5]

Been, C, Bernstem, PA, and Goodman, N "A Sophlstlcate's Introductlon to Database Normahzatlon Theory," Proc VLDB 1978, pp 113-124

[6]

Bemstem, P A, Goodman, N "What Does Boyce-Codd Normal Form Do?'' Proc VLDB 1980, pp 245-259

[7]

Brosda, V, Vossen, G, "Updating a Relatlonal Database Through a Un,versal Schema Intelface," Proc A CM PODS, 1985, pp 66-75

Digital Library

[8]

Chan, E P F, Atzem, P, "Connechon-trapflee Database Schemes," submitted to pubhcahon, 1986

[9]

Chan, EPF, Hern~ndez, H J, "On the Des~rabdlty of 7-acychc BCNF database schemes," to appear m Theoretscal Computer Sczence, 1988

Digital Library

[10]

Chan, E P F, Hern~aldez, H J, "Independence-reducible Database Schemes," to appear in Proc ACM PODS, 1988

Digital Library

[11]

Chan, E P F, Mendelzon, A 0, "Answermg Queries on the Embedded-complete Database Schemes," Journal of A CM 3~ o~ (1987), pp 349-375

Digital Library

[12]

Codd, E F "A Relational Model for Large Shared Data Banks," CA CM 18, 6 (1970), pp 37%387

Digital Library

[13]

Graham, M H, Mendelzon, A O, "The Power of Canomcal Quenes," unpubhshed manuscript, 1983

[14]

Graham, M H, Mendelzon, A O, Vardl, M Y, "Notmns of Dependency Satmfachon," Journal of A CM 33 1 (1986), pp 105- 129

Digital Library

[15]

Graham, M H, Wang, K, "Constant Time Maintenance or the Trmmph of the fd," Proc A CM PODS lg86, pp 202-216

Digital Library

[16]

Graham, M H, Yannakahs, M, "Independent Database Schemas," Journal of Computer and System Sc:ences B8 1 (198~), pp 121-141

[17]

Honeyman, P, "Extension Joms," Proc VLDB 1980, pp 239-244

[18]

Honeyman, P, "Testing Sahsfachon of Funchonal Dependencms," Journal of A CM P,9 3 (198e,), pp 668-677

Digital Library

[19]

Ito, M, Iwasah, M, Kasaml, T, "Some Results on the Representative Instance m Relational Databases," SIAM J on Computing 14 e (1985), pp 334-354

[20]

LeDoux, C H, Parker, D S "Refleehons on Boyce-Codd Normal Form," Proc VLDB 198~, pp 131-141

Digital Library

[21]

Lucchesl, C L, Osborn, S L "Can&date Keys for Relations," Journal of Computer and System Scsences 17, 2 (1978), pp 270- 279

[22]

Mendelzon, A O, "Database States and Their Tableaux," A CM TODS 9 "2 (1984), pp 264-282

Digital Library

[23]

Ma~er, D, The Theory of Relatzonal Databases, Computer Scmnee Press, 1983

Digital Library

[24]

Maaer, D, Mendelzon, A O, Saglv, Y, "Testing implleatmns of Data Dependeneros," A CM TODS 4 4 (1979), pp 455-469

Digital Library

[25]

Mater, D, Ullman, J D, Vardl, M Y, "On the Foundations of the Umversal Relatmn Model," A CM TODS 9 ~ (1984), pp 283- 308

Digital Library

[26]

Osborn, S L "Testing for Exmtence of a Covering Boyce-Codd Normal Form," IPL 8, 1 (1979), pp 11-14

[27]

Saglv, Y, "Can We Use The Umversal Instance Assumptmn Without Using Nulls~'' Proc ACM SIGMOD 1981, pp 108-120

Digital Library

[28]

Saglv, Y, "A Charaetenzatmn of Globally Consmtent Databases and Their Correct Access Paths," A CM TODS 8 P. (1988), pp 266-286

Digital Library

[29]

Saglv, Y, "Evaluatmn of Quenes m Independent Database Schemes," submitted to pubhcatmn, 1984

[30]

Ullman, J D, Prmczples of Database Systents, Computer Semnee Press, Potomac, 1982

[31]

Vassdmu, Y, "A Formal Treatment of imperfect Informatmn m Data Management," CSRG TR-I~8, Nov 1980, Umverslty of Toronto

[32]

Yannakakls, M, "Algorithms for Acychc Database Schemes," Proc VLDB 1981, pp 82-94

Cited By

Biskup J(1989)Boyce-Codd normal form and object normal formsInformation Processing Letters10.1016/0020-0190(89)90065-332:1(29-33)Online publication date: 3-Jul-1989
https://dl.acm.org/doi/10.1016/0020-0190%2889%2990065-3
Biskup JDublish P(2011)Objects in relational database schemes with functional, inclusion, and exclusion dependenciesRAIRO - Theoretical Informatics and Applications10.1051/ita/199327030183127:3(183-219)Online publication date: 8-Jan-2011
https://doi.org/10.1051/ita/1993270301831
(2005)Concluding remarks and ongoing researchThe Nested Universal Relation Database Model10.1007/3-540-55493-9_7(159-161)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-55493-9_7
Show More Cited By

Index Terms

A characterization of constant-time maintainability for BCNF database schemes

Recommendations

A characterization of constant-time maintainability for BCNF database schemes
SIGMOD '88: Proceedings of the 1988 ACM SIGMOD international conference on Management of data

The maintenance problem (for database states) of a database scheme R with respect to a set of functional dependencies F is the following decision problem. Let r be a consistent state of R with respect to F and assume we insert a tuple t into r_p ε r. Is ...
Constant-time maintainability: a generalization of independence

The maintenance problem of a database scheme is the following decision problem: Given a consistent database state ρ and a new tuple u over some relation scheme of ρ, is the modified state ρ ∪ {u} still consistent? A database scheme is said to be ...
Constant-time-maintainable BCNF database schemes

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 17, Issue 3

June 1988

431 pages

ISSN:0163-5808

DOI:10.1145/971701

Issue’s Table of Contents

SIGMOD '88: Proceedings of the 1988 ACM SIGMOD international conference on Management of data
June 1988
443 pages
ISBN:0897912683
DOI:10.1145/50202
Editors:
Haran Boral,
Per-Ake Larson

Copyright © 1988 ACM.

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1988

Published in SIGMOD Volume 17, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
307
Total Downloads

Downloads (Last 12 months)39
Downloads (Last 6 weeks)16

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Biskup J(1989)Boyce-Codd normal form and object normal formsInformation Processing Letters10.1016/0020-0190(89)90065-332:1(29-33)Online publication date: 3-Jul-1989
https://dl.acm.org/doi/10.1016/0020-0190%2889%2990065-3
Biskup JDublish P(2011)Objects in relational database schemes with functional, inclusion, and exclusion dependenciesRAIRO - Theoretical Informatics and Applications10.1051/ita/199327030183127:3(183-219)Online publication date: 8-Jan-2011
https://doi.org/10.1051/ita/1993270301831
(2005)Concluding remarks and ongoing researchThe Nested Universal Relation Database Model10.1007/3-540-55493-9_7(159-161)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-55493-9_7
Wang KGraham M(1992)Constant-time maintainabilityACM Transactions on Database Systems10.1145/128903.12890417:2(201-246)Online publication date: 1-Jun-1992
https://dl.acm.org/doi/10.1145/128903.128904
Wang K(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
https://dl.acm.org/doi/10.1145/93605.93624
Wang KGarcia-Molina H(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
https://dl.acm.org/doi/10.1145/93597.93624
Wang KSilberschatz A(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
https://dl.acm.org/doi/10.1145/73721.73733

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents