Abstract
Three new classes of database schemes are defined. The class of weakly independent schemes is a generalization of independent schemes in a centralized environment. The classes of expansion-chased schemes and simple chase join bounded schemes are aimed at capturing the behaviour of the chase process by a static structure, i.e., derivation sequences of relation schemes. We first present a study on containment relationships among various classes of database schemes, which establishes the generality and desirability of these new classes. We then show that the new classes and the class of algebraic-maintainable schemes can be incrementally designed via a known scheme generating method.
This work has been partially supported by the NSERC of Canada.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Atzeni and E.P.F. Chan, "Efficient optimization of simple chase join expressions," ACM TODS, Vol. 14, No. 2 (1989), pp. 212–230
E.P.F. Chan, "Optimal computation of total projections with unions of simple chase join expressions," ACM SIGMOD 1984, pp. 149–163
E.P.F. Chan and H.J. Hernandez, "Independence-reducible database schemes," to appear in JACM (An extended abstract appeared under the same title in ACM PODS 1988, pp. 163–173)
E.P.F. Chan and H.J. Hernandez, "On generating database schemes bounded or constant-time-maintainable by extensibility," Acta Informatica, 25, (1988), pp. 475–496
M.H. Graham, "Path expressions in databases," ACM PODS 1983, pp. 366–378
M.H. Graham and M.Y. Vardi, "On the complexity and axiomatizability of consistent database states," ACM PODS 1984, pp. 281–289
M.H. Graham and K. Wang, "Constant time maintenance or the triumph of fd's," ACM PODS 1986, pp. 121–141
M.H. Graham and M. Yannakakis, "Independent database schemes," JCSS, 28, 1, 1984, pp. 121–141
P. Honeyman, "Test satisfaction of functional dependencies," JACM, 29, 3, 1982, pp. 668–677
H.J. Hernandez and K. Wang, "On the boundedness of constant-time-maintainable database schemes," submitted to publication, 1989
M. Ito, M. Iwasaki and T. Kasam, "Some results on the representative instances in relational databases," SIAM J. Comput., Vol. 14, No. 2, (May, 1985), pp. 334–353
A.O. Mendelzon, "Database states and their tableaux," ACM TODS, Vol. 9, No. 2, pp. 264–282
D. Maier, The theory of relational databases, CSP Inc., 1983
D. Maier, J.D. Ullman, Y. Sagiv, "Testing implication of data dependencies," ACM TODS, Vol. 4, No. 4, (1979), pp. 455–469
D. Maier, J.D. Ullman, M.Y. Vardi, "On the foundations of the universal relation model," ACM TODS, Vol. 9, No. 2, (1984), pp. 283–308
Y. Sagiv, "A characterization of globally consistent databases and their correct access pathes," ACM TODS, Vol. 8, No., 2, (1983), pp. 266–286
J.D. Ullman, Principles of database systems, CSP, Inc., 1982
K. Wang, "Can constant-time-maintainability be more practically useful?" ACM PODS 1989, pp. 120–127
K. Wang and M.H. Graham, "Constant-time-maintainability: a generalization of independence," submitted to publication, 1988 (See [GW] for an extended abstract)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, K., Yuan, L.Y. (1991). Incremental database design revisited. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_171
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive