The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
The theory of joins in relational databases
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Self-citationDepth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
A relational model of data for large shared data banks
Codd, E. F. (1970) · Communications of the ACM · doi:10.1145/362384.362685 · Cited by 5,547
A relational model of data for large shared data banks
Codd, E. F. (1983) · Communications of the ACM · doi:10.1145/357980.358007 · Cited by 4,796
Multivalued dependencies and a new normal form for relational databases
Fagin, R. (1977) · ACM Transactions on Database Systems · doi:10.1145/320557.320571 · Cited by 712
Further Normalization of the Data Base Relational Model
Codd, E. F. (1972) · Medical Entomology and Zoology · Cited by 617
Synthesizing third normal form relations from functional dependencies
Bernstein, P. A. (1976) · ACM Transactions on Database Systems · doi:10.1145/320493.320489 · Cited by 448
Recent Investigations in Relational Data Base Systems.
Codd, E. F. (1974) · IFIP Congress · Cited by 257
Beeri, C., Bernstein, P. A., & Goodman, N. (1989) · Readings in Artificial Intelligence and Databases · doi:10.1016/b978-0-934613-53-8.50035-2 · Cited by 215
Self-citationIndependent components of relations
Rissanen, J. (1977) · ACM Transactions on Database Systems · doi:10.1145/320576.320580 · Cited by 186
A generalized access path model and its application to a relational data base system
Carlson, C. R., & Kaplan, R. S. (1976) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/509383.509403 · Cited by 39
Cited by
Extending the database relational model to capture more meaning
Codd, E. F. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320109 · Cited by 1,559
On the Desirability of Acyclic Database Schemes
Beeri, C., Fagin, R., Maier, D., & Yannakakis, M. (1983) · Journal of the ACM · doi:10.1145/2402.322389 · Cited by 808
Self-citationInformation systems theoretical foundations
Pawlak, Z. (1981) · Information Systems · doi:10.1016/0306-4379(81)90023-5 · Cited by 665
Testing implications of data dependencies
Maier, D., Mendelzon, A. O., & Sagiv, Y. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320115 · Cited by 582
Join processing in relational databases
Mishra, P., & Eich, M. H. (1992) · ACM Computing Surveys · doi:10.1145/128762.128764 · Cited by 409
Metadata
- Authors
- Aho, A. V., Beeri, C., & Ullman, J. D.
- Venue
- ACM Transactions on Database Systems
- Published
- 1979-09
- Volume
- 4
- Issue
- 3
- Pages
- 297-314
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2032386524
- Cited by
- 423
- References
- 11
- FWCI
- 48.07
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.