Abstract
In a relational database model, checking the contraints of join dependency involves examining a set of n tuples and solving m 1 constraint equalities. We derive a scheme called the (n,m)-JD in which the number of constraint equalities is reduced to m 2, by forming cyclic combinations of the (disjoint) elements of the partition and increasing the number of intersection operations to obtain the projections in the constraint equalities. The reduced set of constraint equalities results in less elementary checking operations and hence an overall increase in efficiency in the normalization effort. The relationship among (n,m)-JDs of various degrees and orders is also studied and formalised.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
7. References
Aho, A. V., Beeri, C. and Ullman, J. D., "The Theory of Joins in Relational Databases", ACM TODS 4, No. 3, Sept. 1979, pp. 297–314.
Berri, C. and Vardi, M., "On the Properties of Total Join Dependencies", H. Gallaire, J. Minker, and J. M. Nicolas (Ed), Advances in Database Theory, Vol. 1, Plenum Press, New York, 1981, pp. 25–71.
Codd, E. F., "Normalized Data Base Structure: A Brief Tutorial", Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access and Control, San Diego, Ca., Nov. 11–12, 1971, E. F. Codd and A. L. Dean (Eds).
Codd, E. F., "Further Normalization of the Data Base Relational Model", Data Base System, R. Rustin (Ed), Courant Computer Science Symposium, Vol. 6, Prentice-Hall, Englewood Cliffs, N.J., 1972, pp. 33–64.
Delobel, C., "Normalization and Hierarchical Dependencies in the Relational Data Model", ACM TODS 3, No. 3, Sept. 1978, pp. 201–222.
Fagin, R., "Multivalued Dependencies and a New Normal Form for Relational Databases", ACM TODS 2, No. 3, Sept. 1977, pp. 262–278. Also IBM Research Report RJ1812.
Fagin, R., "Normal Forms and Relational Database Operators", Proc. 1979 ACM SIGMOD Intl. Conf. on Management of Data, Boston, Mass., May 1979. Also IBM Research Report RJ2471, Feb. 19, 1979.
Gyssens, M., "Embedded Join Dependencies as a tool for decomposing Full Join Dependencies", Proc. 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 1985, pp. 205–214.
Maier, D., The Theory of Relational Databases, Computer Science Press, 1983.
Nicolas, J. M., "Mutual Dependencies and Some Results on Undecomposable Relations", Proc. 4th Int. Conf. on Very Large Data Bases, West Berlin, Germany, Sept. 1978, pp. 360–367.
Rissanen, J., "Theory of Joins for Relational Databases — A Tutorial Survey", Proc. 7th Sym. on Math. Foundations of Comp. Sc., Lecture Notes in Computer Sc. 64, Winkowski (ed), Spring-Verlag, New York, 1978, pp. 537–551.
Sciore, E., "A Complete Axiomization of Full Join Dependencies", JACM, Vol.29, No.2, Apr. 1982, pp 373–393.
Tan, K. P., "A Less Costly Constraints Checking for Join Dependency", Proc. of the 10th Intl. Conference on Very Large Data Bases, Aug. 1984, pp. 63–68.
Ullman, J. D., Principles of Database Systems, Computer Science Press, Potomac, Maryland, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tan, K.P., Tan, T.C. (1991). An improved join dependency for efficient constraint checking. 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_167
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_167
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