Abstract
A methodology is given to decompose a join dependency defined on a given relation scheme. The methodology works for acyclic as well as for cyclic join dependencies.
It is proved that every decomposable join dependency can be decomposed by this methodology. Furthermore the resulting set of join dependencies is nonredundant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A. V., Beeri, C., Ullman, J. D. [1977] “The Theory of Joins in Relational Data Bases”, 18th Ann. Symp. on Foundations of Comp. Sc ,1977, 107–113.
Ausiello, G., D’Atri, A., Moscarini, M. [1984] “Minimal Coverings of Acyclic Database Schemata”, In: Advances in Database Theory, Volume 2 (H. Gallaire, J. Minker and J. M. Nicolas, Eds.), Plenum Publishing Co., New York (1984) 301–325,
Beeri, C., Fagin, R., Maier, D., Mendelzon, A. O., Ullman, J.D., Yahnakakis, M. [198] “Properties of Acyclic Database Schemes”, Proc. 13th Ann. ACM Symp. on the Theory of Computing ,1981, 355–362.
Beeri, C., Fagin, R., Maier, D., Yannakakis, M. [1981] “On the Desirability of Acyclic Database Schemes”, RJ 3131, IBM, San Jose, 1981, to appear in Journal of ACM.
Codd, E. F. [1972] “Further Normalizations of the Relational Data Base Model”, In: Data Base Systems (R. Rustin, Ed.), Prentice Hall, Englewood Cliffs, N.J., 1972, 33–64.
Fagin, R. [1977] “Multivalued Dependencies and a New Normal Form for Relational Databases”, ACM Transactions on Database Systems 2 ,3 (1977) 262–278.
Fagin, R. [1983] “Acyclic Database Schemes (of Various Degrees): A Painless Introduction”, Proc. CAAP 1983, L’Aquila, 1983.
Fagin, R., Mendelzon, A. O., Ullman, J. D. [1982] “A Simplified Universal Relation Assumption and Its Properties”, ACM Transactions on Database Systems 7, 3 (Sept. 1982), 343–360.
Graham, M. H. [1979] “On the Universal Relation”, Techn. Rep. ,University of Toronto ,Sept. 1979.
Hanatani, Y. [1984] “Eliminating Cycles in Data Base Schemas”, In: Advances in Database Theory, Vol. 2 (H. Gallaire, J. Minker and J.-M. Nicholas, Eds.), Plenum Publ. Co., N.Y. (1984) 53–84.
Maier, D., Mendelzon, A. O., Sagiv, Y. [1979] “Testing Implication of Data Dependencies”, ACM Transactions on Database Systems 4 ,4 (1979) 455–469.
Nicolas, J. M. [1978] “Mutual Dependencies and Some Results on Undecomposable Relations”, Proc. ACM Int. Conf. on Very Large Databases ,(1978) 360–367.
Rissanen, J. [1978] “Theory of Joins for Relational Dababases -A Tutorial Survey”, Proc. 7th Symp. on Math. Found, of Comp. Sc. ,Lecture Notes in Comp. Sc. 64, Springer Verlag, Berlin, Heidelberg (1978) 537–551.
Sciore, E. [1982] “A Complete Axiomatization of Full-Join Dependencies”, Journal of ACM 29 ,2 (April 1982) 373–393.
Zaniolo, C. [1976] “Analysis and Design of Relational Schemata for Database Systems”, Techn. REP. UCLA-ENG-7669 ,Dept. of Comp. Sc, University of California, Los Angeles (1976).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Gyssens, M., Paredaens, J. (1984). A Decomposition Methodology for Cyclic Databases. In: Gallaire, H., Minker, J., Nicolas, J.M. (eds) Advances in Data Base Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-9385-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-9385-0_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-9387-4
Online ISBN: 978-1-4615-9385-0
eBook Packages: Springer Book Archive