Abstract
Normalization and dependency theory is used for the logical design of relational data bases. Historically this theory has been based on the operations projection and natural join. Some work has been reported in the literature for the operations union and splitting. This paper extends this theory to the operation theta-join.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
W. W. Armstrong, “Dependency Structures of Data Base Relationships,”Proc. of IFIP '74, 580–583 (North-Holland, New York, 1974).
S. K. Arora and K. C. Smith, “Well Connected Relations in Dependency Structutes of Data Bases,”Proc. of Conference 1979 CIPS/DPMA/FIQ, 95–101 (1979).
S. K. Arora and K. C. Smith, “A Normal Form Based on Theta-Join and Projection for Relational Data Bases,”IEEE COMPCON Fall 1980, 295–300 (1980).
C. Beeri, R. Fagin, and J. H. Howard, “A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations,”ACM SIGMOD, 47–61 (Toronto, 1977).
E. F. Codd, “Further Normalization of the Data Base Relational Model,”Courant Computer Science Symposium: Data Base Systems, Ed. R. Rustin,6:33–64 (Prentice Hall, New York, 1971).
E. F. Codd, “Recent Investigations in Relational Data Base Systems,”IFIP 74 (North Holland Pub. Co., New York, 1974).
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 a 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 Propositional Logic,”IBM J. Res. Develop., 534–544 (1977).
R. Fagin, “Normal Forms and Relational Operators,”ACM SIGMOD, 153–160 (Boston, 1979).
R. Fagin, “Horn Clauses and Database Dependencies,” IBM Res. Rep., Rj 2741, (1980).
I. J. Heath, “Unacceptable File Operations in a Relational Data Base,” Proc. ACM SIGFIDET Workshop on Data Description, Access and Control, 19–33 (1971).
D. Janssens and J. Paredaens, “General Dependencies,” (University of Antwerp)Res. Rep. 79–35 (1979).
Y. E. Lein, “Multivalued Dependencies with Null Values in Relational Databases,”Proc. 5th Int. Conf. on VLDB, 61–66 (Brazil, 1979).
A. O. Mendelzon and D. Maier, “Generalized Mutual Dependencies and the Decomposition of Database Relations,”Proc. 5th Int. Conf. on VLDB, 75–82 (Brazil, 1979).
A. O. Mendelzon, “On Axiomatizing Multivalued Dependencies in Relational Databases,”J. of ACM,26 (1):37–44 (1979).
J. M. Nicolas, “Mutual Dependencies and Some Results on Undecomposable Relations,”VLDB 78, 13–15 (Berlin, 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 Dara Bases-A Tutotial Survey,”Proc. 7th Symp. on Math. Foundations of Computer Science, Lecture Notes in Computer Science,64:537–551 (Springer-Verlag, 1978).
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 (1980).
Y. Sagiv and Walecka, “Subset Dependencies as an 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).
H. A. Schmid and J. R. Swenson, “On the Semantics of the Relational Data Model,”ACM SIGMOD International Conference on Management of Data, 211–223 (1975).
J. M. Smith, “A Normal Form for Abstract Syntax,”Proc. VLDB, 156–162 (West Berlin, 1978).
Y. Vassiliou, “Functional Dependencies and Incomplete Information,”Proc. VLDB, 260–269 (1980).
M. Yannakakis and C. M. Papadimitrou, “Algebraic Dependencies,”M.I.T. Research Report (1980).
Author information
Authors and Affiliations
Additional information
This research was supported in part by the Science and Engineering Research Board Grant Number 214–7248.
Rights and permissions
About this article
Cite this article
Arora, S.K., Dumpala, S.R. Theta-join and normalization. International Journal of Computer and Information Sciences 10, 261–281 (1981). https://doi.org/10.1007/BF01007884
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01007884