The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Candidate keys for relations
Open accessOverview
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 complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
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
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
Identifying the Minimal Transversals of a Hypergraph and Related Problems
Eiter, T., & Gottlob, G. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539793250299 · Cited by 437
Profiling relational data: a survey
Abedjan, Z., Golab, L., & Naumann, F. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0389-y · Cited by 283
Elements of Relational Database Theory
KANELLAKIS, P. C. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50022-6 · Cited by 259
Metadata
- Authors
- Lucchesi, C. L., & Osborn, S. L.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1978-10
- Volume
- 17
- Issue
- 2
- Pages
- 270-279
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2063645305
- Cited by
- 160
- References
- 2
- FWCI
- 3.96
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Candidate keys for relations. https://app.cochat.ai/papers/10.1016/0022-0000(78)90009-0
- The paper
- Lucchesi, C. L., & Osborn, S. L. (1978). Candidate keys for relations. Journal of Computer and System Sciences. https://doi.org/10.1016/0022-0000(78)90009-0
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.