The theory of joins in relational data bases

A. V. Aho; C. Beeri; J. D. Ullman

doi:10.1109/sfcs.1977.33

The theory of joins in relational data bases

A. V. Aho, C. Beeri, J. D. Ullman

Research output: Contribution to journal › Conference article › peer-review

24 Scopus citations

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 Oossless} 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.

Original language	English
Pages (from-to)	107-113
Number of pages	7
Journal	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume	1977-October
DOIs	https://doi.org/10.1109/sfcs.1977.33
State	Published - 1977
Externally published	Yes
Event	18th Annual Symposium on Foundations of Computer Science, SFCS 1977 - Providence, United States Duration: 31 Oct 1977 → 2 Nov 1977

Bibliographical note

Publisher Copyright:
© 1977 IEEE Computer Society. All rights reserved.

Access to Document

10.1109/sfcs.1977.33

Cite this

@article{5c39ea82ce6b45338610ba4e84462778,

title = "The theory of joins in relational data bases",

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 Oossless} 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.",

author = "Aho, {A. V.} and C. Beeri and Ullman, {J. D.}",

note = "Publisher Copyright: {\textcopyright} 1977 IEEE Computer Society. All rights reserved.; 18th Annual Symposium on Foundations of Computer Science, SFCS 1977 ; Conference date: 31-10-1977 Through 02-11-1977",

year = "1977",

doi = "10.1109/sfcs.1977.33",

language = "אנגלית",

volume = "1977-October",

pages = "107--113",

journal = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

issn = "0272-5428",

}

TY - JOUR

T1 - The theory of joins in relational data bases

AU - Aho, A. V.

AU - Beeri, C.

AU - Ullman, J. D.

PY - 1977

Y1 - 1977

N2 - 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 Oossless} 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.

AB - 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 Oossless} 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.

UR - http://www.scopus.com/inward/record.url?scp=85068003052&partnerID=8YFLogxK

U2 - 10.1109/sfcs.1977.33

DO - 10.1109/sfcs.1977.33

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:85068003052

SN - 0272-5428

VL - 1977-October

SP - 107

EP - 113

JO - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

JF - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

T2 - 18th Annual Symposium on Foundations of Computer Science, SFCS 1977

Y2 - 31 October 1977 through 2 November 1977

ER -

The theory of joins in relational data bases

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this