Abstract
The designer of a relational data base must use dependency structures of data to model semantic situations that arise in data. He must further ensure that these dependencies are not violated during operations on the data base. In this paper we study a subclass of dependencies, namely, root-dependencies and introduce a common graphical picture (S-diagram) for all of them. This effort offers a possible application of graph theory to the study of relational data bases. The S-diagram offers a pictorial insight to all the root-dependencies. We also discuss, briefly, other possible uses of our work such as automatic constraint checking and recovery of data in a damaged data base.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. W. Armstrong, “Dependency Structures of Data Base Relationships,”Proc. of IFIP 74, pp. 580–583 (1974).
S. K. Arora and K. C. Smith, “A Theory of Well Connected Relations,”J. of Information Sciences 19(2):97–134 (1979).
S. K. Arora and K. C. Smith, “A Dependency Theory and a ‘New’ Dependency for Relational Data Bases,”ACM Computer Science Conference (February 1979).
S. K. Arora and K. C. Smith, “Well Connected Relations in Dependency Structures of Data Bases,” Proc. of Conference 1979 CIPS/DPMA/FIQ, pp. 95–101 (June 1979).
S. K. Arora and K. C. Smith, “A Normal Form Based on Theta Join and Projection for Relational Data Bases,”IEEE COMPCON FALL, pp. 295–300 (1980).
P. A. Bernstein, “Normalization and Functional Dependencies in the Relational Data Base Model,” Ph.D. Thesis, Dept. of Computer Science, University of Toronto, (1975).
E. F. Codd, “A Relational Model of Data of Data for Large Shared Data Banks,”Comm. of the ACM 13(6):377–387 (une 1970).
E. F. Codd, “Further Normalization of the Data Base Relational Model,” inCourant Computer Science Symposium 6, Data Base Systems, R. Rustin, Ed. (Prentice Hall, May 1971), pp. 33–64.
C. Delobel and R. G. Casey, “Decomposition of a Data Base and the Theory of Boolean Switching Functions,”IBM J. of Res. Develop. 17(5):374–386 (1973).
C. Delobel, “Normalization and Hierarchical Dependencies in the Relational Data Model,”ACM TODS 3(3):201–222 (1978).
R. Fagin, “Multivalued Dependencies and a New Normal Form for Relational Databases,”ACM TODS 2(3):262–278 (1977).
R. Fagin, “Functional Dependencies in a Relational Database and Prepositional Logic,”IBM J. Res. Develop. 21(6):534–544 (1977).
R. Fagin, “Horn Clauses and Database Dependencies,”IBM Res. Rep. RJ2741, (March 1980).
A. L. Furtado and L. Kershcberg, “An Algebra of Quotient Relations,”ACM SIGMOD, pp. 1–8 (1977).
A. L. Furtado and K. C. Sevcik, “Permitting Updates Through User Views of Data Bases,”P.U.C.E. Tech. Rep. (Dec. 1977).
D. Janssens and J. Paredaens, “General Dependencies,” University of Antwerp,Res. Rep. 79–35, (December 1979).
Y. Lien, “Multivalued Dependencies with Null Values in Relational Data Bases,”Proc. of Fifth Inernational Conference on Very Large Data Bases, pp. 61–66 (Oct. 1979).
A. O. Mendelzon and D. Mairer, “Generalized Mutual Dependencies and the Decomposition of Database Relations,”Proc. 5th. Int. Conf. on VLDB, pp. 75–82 (October 1979).
J. M. Nicolas, “Mutual Dependencies and Some Results on Undecomposable Relations,”VLDB 78 (Sept. 13–15, 1978).
J. M. Nicolas, “Addendum and Erratum to ‘Mutual Dependencies and Some Results on Undecomposable Relations’,” Unpublished Report (August 1978).
J. M. Nicolas, Private Communication (Dec. 1978).
J. Paredaens and H. Gallaire, “Transitive Dependencies in a Database Scheme,”R.A.I.R.O. Informatique/Computer Science 14(2):149–163 (1980).
J. Rissanen, “Theory of Relations for Data Bases-A Tutotial Survey,”Proc. 7th Symp. on Math. Foundations of Computer Science, Lecture Notes in Computer Science (Springer-Verlag, 1978), pp. 537–551.
F. Sadri and J. D. Ullman, “A Complete Axiomatization for a Large Class of Dependencies in Relational Databases,”Proc. 12th. Annual ACM Symp. on Theory of Computing (April 1980).
Y. Sagiv and S. Walecka, “Subset Dependencies as a Alternative to Embedded Multivalued Dependencies,” Dept. of Computer Science, University of Illinois at Urbana-Champaign, (UIUCDCS-R-79-980), (UILU-ENG 79 1732), (July 1979).
M. A. Schmid and J. R. Swenson, “On the Semantics of the Relational Data Model,”ACM SIGMOD International Conference on Management of Data (May 1975), pp. 211–223.
K. C. Sevcik and A. L. Furtado. “Complete and Compatible Sets of Update Operations,”Proc. Int. Conf. on Data Base Management Systems (June 1978), pp. 247–260.
M. Yannakakis and C. M. Papdimitriou, “Algebraic Dependencies,”M.I.T. Research Report (1980).
C. Zaniolo, “Analysis and Design of Relational Schemata for Database Systems,” Ph.D. Thesis, (UCLA-ENG-7669), (1976).
Rights and permissions
About this article
Cite this article
Arora, S.K., Smith, K.C. A graphical interpretation of dependency structures in relational data bases. International Journal of Computer and Information Sciences 10, 187–213 (1981). https://doi.org/10.1007/BF00996830
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00996830