The DOI matches its Crossref record; 149 of the 149 references it cites were found in a registry or an index.
Elements of Relational Database Theory
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(1979) · Cited by 43,841
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
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Access path selection in a relational database management system
Selinger, P. G., Astrahan, M. M., Chamberlin, D. D., Lorie, R. A., & Price, T. G. (1979) · Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79 · doi:10.1145/582095.582099 · Cited by 2,188
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
Korth, H. F., & Silberschatz, A. (1980) · Cited by 1,784
Apt, K. R. (1992) · Cited by 1,678
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
Cited by
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Metadata
- Authors
- KANELLAKIS, P. C.
- Venue
- Formal Models and Semantics
- Publisher
- Elsevier
- Published
- 1990
- Pages
- 1073-1156
- OpenAlex
- W1547414429
- Cited by
- 259
- References
- 149
- FWCI
- 22.61
- Type
- book chapter
- Language
- en
- Open access
- closed
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: Elements of Relational Database Theory. https://app.cochat.ai/papers/10.1016/b978-0-444-88074-1.50022-6
- The paper
- KANELLAKIS, P. C. (1990). Elements of Relational Database Theory. Formal Models and Semantics. https://doi.org/10.1016/b978-0-444-88074-1.50022-6
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.