The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A normal form for relational databases that is based on domains and keys
Open accessAbstract
A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also, formal definitions of insertion anomaly and deletion anomaly are presented. It is shown that a schema is in DK/NF if and only if it has no insertion or deletion anomalies. Unlike previously defined normal forms, DK/NF is not defined in terms of traditional dependencies (functional, multivalued, or join). Instead, it is defined in terms of the more primitive concepts of domain and key, along with the general concept of a “constraint.” We also consider how the definitions of traditional normal forms might be modified by taking into consideration, for the first time, the combinatorial consequences of bounded domain sizes. It is shown that after this modification, these traditional normal forms are all implied by DK/NF. In particular, if all domains are infinite, then these traditional normal forms are all implied by DK/NF.
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
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 general Datalog-based framework for tractable query answering over ontologies
Calì, A., Gottlob, G., & Lukasiewicz, T. (2012) · Journal of Web Semantics · doi:10.1016/j.websem.2012.03.001 · Cited by 407
Fuzzy functional dependencies and lossless join decomposition of fuzzy relational database systems
Raju, K. V. S. V. N., & Majumdar, A. K. (1988) · ACM Transactions on Database Systems · doi:10.1145/42338.42344 · Cited by 406
Testing containment of conjunctive queries under functional and inclusion dependencies
Johnson, D. S., & Klug, A. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90081-3 · Cited by 313
Inclusion dependencies and their interaction with functional dependencies
Casanova, M. A., Fagin, R., & Papadimitriou, C. H. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90075-8 · Cited by 260
Self-citationElements 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
- Fagin, R.
- Venue
- ACM Transactions on Database Systems
- Published
- 1981-09
- Volume
- 6
- Issue
- 3
- Pages
- 387-415
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2000773957
- Cited by
- 228
- References
- 1
- FWCI
- 22.09
- 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: A normal form for relational databases that is based on domains and keys. https://app.cochat.ai/papers/10.1145/319587.319592
- The paper
- Fagin, R. (1981). A normal form for relational databases that is based on domains and keys. ACM Transactions on Database Systems. https://doi.org/10.1145/319587.319592
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.