The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Independent components of relations
Open accessAbstract
In a multiattribute relation or, equivalently, a multicolumn table a certain collection of the projections can be shown to be independent in much the same way as the factors in a Cartesian product or orthogonal components of a vector. A precise notion of independence for relations is defined and studied. The main result states that the operator which reconstructs the original relation from its independent components is the natural join, and that independent components split the full family of functional dependencies into corresponding component families. These give an easy-to-check criterion for independence.
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
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
Cited by
A comparative analysis of methodologies for database schema integration
Batini, C., Lenzerini, M., & Navathe, S. B. (1986) · ACM Computing Surveys · doi:10.1145/27633.27634 · Cited by 1,740
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
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
Computational problems related to the design of normal form relational schemas
Beeri, C., & Bernstein, P. A. (1979) · ACM Transactions on Database Systems · doi:10.1145/320064.320066 · Cited by 461
Metadata
- Authors
- Rissanen, J.
- Venue
- ACM Transactions on Database Systems
- Published
- 1977-12
- Volume
- 2
- Issue
- 4
- Pages
- 317-325
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W1998512182
- Cited by
- 186
- References
- 1
- FWCI
- 20.67
- 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.