The theory of joins in relational data bases
- 1 September 1977
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 107-113
- https://doi.org/10.1109/sfcs.1977.33
Abstract
Answering queries in a relational database often requires that the natural join of two or more relations be computed. However, not all joins are semantically meaningful. This paper gives an efficient algorithm to determine whether the join of several relations is semantically meaningful (lossless) and an efficient algorithm to determine whether a set of relations has a subset with a lossy join. These algorithms assume that all data dependencies are functional. Similar techniques also apply to the case where data dependencies are multivalued.Keywords
This publication has 6 references indexed in Scilit:
- Multivalued dependencies and a new normal form for relational databasesACM Transactions on Database Systems, 1977
- Synthesizing third normal form relations from functional dependenciesACM Transactions on Database Systems, 1976
- The design and implementation of INGRESACM Transactions on Database Systems, 1976
- On the feasibility of implementing a large relational data base with optimal performance on a minicomputerPublished by Association for Computing Machinery (ACM) ,1975
- Decomposition of a Data Base and the Theory of Boolean Switching FunctionsIBM Journal of Research and Development, 1973
- A relational model of data for large shared data banksCommunications of the ACM, 1970