article

Free access

The theory of joins in relational databases

Editor: David K. Hsiao Authors:

J. D. UllmanAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 4, Issue 3

Pages 297 - 314

https://doi.org/10.1145/320083.320091

Published: 01 September 1979 Publication History

Abstract

Answering queries in a relational database often requires that the natural join of two or more relations be computed. However, the result of a join may not be what one expects. In this paper we give efficient algorithms to determine whether the join of several relations has the intuitively expected value (is lossless) and to determine whether a set of relations has a subset with a lossy join. These algorithms assume that all data dependencies are functional. We then discuss the extension of our techniques to the case where data dependencies are multivalued.

References

[1]

AHO, A.V., HOPCROFT, J.E., AND ULLMAN, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.

Digital Library

[2]

ARMSTRONG, W.W. Dependency structures of data base relationships. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 580-583.

[3]

ARORA, A.K., AND CARLSON, C.R. The information preserving properties of relational database transformations. Proc. Int. Conf. on Very Large Data Bases, West Berlin, Sept. 1978, pp. 352-359.

[4]

BEF.RI, C. On the membership problem for multivalued dependencies in relational database systems. Tech. Rep. 229, Dept. Elec. Eng. and Comptr. Sci., Princeton U., Princeton, N.J., Sept. 1977. To appear in A CM Trans. Database Syst.

[5]

BEERI, C., BERNSTEIN, P.A., AND GOODMAN, N. A sophisticate's introduction to database normalization theory. Proc. Int. Conf. on Very Large Data Bases, West Ber!in, Sept. 1978, pp. 113-124.

[6]

BERNSTEIN, P.A. Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1, 4 (Dec. 1976), 277-298.

Digital Library

[7]

BERNSTEIN, P.A., AnD BEERI, C. An algorithmic approach to normalization of relational database schemas. Tech. Rep. CSRG-73, Comptr. Sci. Res. Group, U. of Toronto, Toronto, Canada, Sept. 1976.

[8]

BEERI, C., FAGIN, R., AND HOWARD, J.H. A complete axiomatization for functional and multivalued dependencies. Proc. ACM SIGMOD Int. Conf. on Manage. of Data, Toronto, Canada, Aug. 1977, pp. 47-61.

Digital Library

[9]

CARLSON, C.R., AND KAPLAN, R.S. A generalized access path model and its application to a relational data base system. Proc. ACM SIGMOD Conf., Washington, D.C., 1976, pp. 143-154.

[10]

CODD, E.F. A relational model for large shared data banks. Comm. ACM 13, 6 (June 1970), 377- 387.

Digital Library

[11]

CODD, E.F. Further normalization of the data base relational model. In Data Base Systems, R. Rustin, Ed., Prentice-Hall, Englewood Cliffs, N.J., 1972, pp. 33-64.

[12]

CODD, E.F. Recent investigations in relational data base systems. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 1017-1021.

[13]

DELOBEL, C. Contributions theoretiques a la conception d'un systeme d'informations. Ph.D. Th., U. of Grenoble, Grenoble, France, Oct. 1973.

[14]

DELOBEL, C., AND CASEY, R.G. Decomposition of a data base and the theory of Boolean switching functions. IBM J. Res. and Develop. 17, 5 (Sept. 1972), 370-386.

[15]

FAGIN, R. Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst. 2, 3 (Sept. 1977), 262-278.

Digital Library

[16]

GUTHERY, S.B., AND O'NEILL, D.M. The syntax and semantics of functional dependency. Unpub. memo., Bell Laboratories, Holmdel, N.J., 1976.

[17]

MAIER, D., MENDELZON, A.O., SADRI, F., AND ULLMAN, J.D. Adequacy of decompositions of relational databases. Dept. Elec. Eng. and Comptr. Sci., Princeton University, Princeton, N.J., 1979.

[18]

MANACHER, G.K. On the feasibility of implementing a large relational data base with optimal performance on a minicomputer. Proc. Int. Conf. on Very Large Data Bases, Framingham, Mass., Sept. 1975, pp. 175-201.

Digital Library

[19]

RISSANEN, J. Independent components of relations. ACM Trans. Database Syst. 2, 4 (Dec. 1977), 317-325.

Digital Library

[20]

TARJAN, R.E. Depth-first search and linear graph algorithms. SIAM J. Comptng. 1, 2 (1972), 146-160.

[21]

ZANIOLO, C. Analysis and design of relational schemata for database systems. Tech. Rep. UCLA- ENG-7769, Dept. Comptr. Sci., U. of California, Los Angeles, Calif., July 1976.

Digital Library

Cited By

Zhang ZLink S(2024)Mixed Covers of Keys and Functional Dependencies for Maintaining the Integrity of Data under UpdatesProceedings of the VLDB Endowment10.14778/3654621.365462617:7(1578-1590)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.14778/3654621.3654626
Ben Amara OHadouaj SMeneghetti N(2024)StarfishDB: A Query Execution Engine for Relational Probabilistic ProgrammingProceedings of the ACM on Management of Data10.1145/36549882:3(1-31)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654988
Atserias AKolaitis P(2024)Consistency of Relations over MonoidsProceedings of the ACM on Management of Data10.1145/36516082:2(1-15)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651608
Show More Cited By

Index Terms

The theory of joins in relational databases

Recommendations

Hierarchical schemata for relational databases

Most database design methods for the relational model produce a flat database, that is, a family of relations with no explicit interrelational connections. The user of a flat database is likely to be unaware of certain interrelational semantics. In ...
Query Interoperation Among Object-Oriented and Relational Databases
ICDE '95: Proceedings of the Eleventh International Conference on Data Engineering

We develop an efficient algorithm for the query interoperation among existing heterogeneous object-oriented and relational databases. Our algorithm utilizes a canonical deductive database as a uniform representation of object-oriented schema and data. ...
Cooperative querying in relational databases
SCCC '97: Proceedings of the 17th International Conference of the Chilean Computer Science Society

This paper proposes an architecture for cooperative access to databases, and describes a cooperative interface for querying relational databases (i.e., an interface that assists non-experienced and casual users to get useful answers from a relational ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 4, Issue 3

Sept. 1979

134 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/320083

Issue’s Table of Contents

Copyright © 1979 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1979

Published in TODS Volume 4, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

347
Total Citations
View Citations
2,767
Total Downloads

Downloads (Last 12 months)286
Downloads (Last 6 weeks)18

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang ZLink S(2024)Mixed Covers of Keys and Functional Dependencies for Maintaining the Integrity of Data under UpdatesProceedings of the VLDB Endowment10.14778/3654621.365462617:7(1578-1590)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.14778/3654621.3654626
Ben Amara OHadouaj SMeneghetti N(2024)StarfishDB: A Query Execution Engine for Relational Probabilistic ProgrammingProceedings of the ACM on Management of Data10.1145/36549882:3(1-31)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654988
Atserias AKolaitis P(2024)Consistency of Relations over MonoidsProceedings of the ACM on Management of Data10.1145/36516082:2(1-15)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651608
Hanisch PKrötzsch M(2024)Chase Termination Beyond Polynomial TimeProceedings of the ACM on Management of Data10.1145/36515942:2(1-17)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651594
Kimelfeld BKolaitis P(2024)A Unifying Framework for Incompleteness, Inconsistency, and Uncertainty in DatabasesCommunications of the ACM10.1145/362471767:3(74-83)Online publication date: 22-Feb-2024
https://dl.acm.org/doi/10.1145/3624717
(2024)BibliographyInformation Modeling and Relational Databases10.1016/B978-0-443-23790-4.09995-3(1029-1040)Online publication date: 2024
https://doi.org/10.1016/B978-0-443-23790-4.09995-3
Halpin TMorgan T(2024)Schema TransformationsInformation Modeling and Relational Databases10.1016/B978-0-443-23790-4.00018-9(681-771)Online publication date: 2024
https://doi.org/10.1016/B978-0-443-23790-4.00018-9
Fagin R(2023)Applying Theory to PracticeJournal of Logic and Computation10.1093/logcom/exad066Online publication date: 20-Nov-2023
https://doi.org/10.1093/logcom/exad066
Koshkin S(2023)Logical reduction of relations: From relational databases to Peirce’s reduction thesisLogic Journal of the IGPL10.1093/jigpal/jzad010Online publication date: 7-Jun-2023
https://doi.org/10.1093/jigpal/jzad010
Kumar ASoffer PTsoury A(2023)Normalizing object-centric process logs by applying database principlesInformation Systems10.1016/j.is.2023.102196115(102196)Online publication date: May-2023
https://doi.org/10.1016/j.is.2023.102196
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents