The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On the Equivalence of Database Models
Open accessAbstract
All eqmvalence is estabhshed between network databases and a subclass of relational databases.A database is a set of files together w~th a set of constraints that the fdes must satisfy.The constraints are spectfied by Bachman diagrams m the network model and by data dependencies m the relational model.The subclass of relatmnal databases of interest ~s characterized by the absence of two properties of data dependencies: conflzct and contention It is proved that network databases with loop-free Bachman diagrams are eqmvalent to relational databases which are free of conflicts and contenUons.When its Bachman dmgram has loops, a network database ts equivalent to a collection of relattonal databases in this subclass.Th~s study of equivalence is also related to database design algorithms.Although the network model cannot capture the nouons of conflict and contention, they are the source of several problems which have been observed in the decomposiuon approach to relational database design, notably the split key problem, the nonumqueness problem, and lossy joins It is shown that the decomposition approach can be apphed to conflict-and contention-free relational databases without any of these problems.The results serve as a theorettcal foundatton for database translatton between different models and for designing multimodel database management systems.
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
The entity-relationship model—toward a unified view of data
Chen, P. P.-S. (1976) · ACM Transactions on Database Systems · doi:10.1145/320434.320440 · Cited by 4,708
Cited by
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
A simplied universal relation assumption and its properties
Fagin, R., Mendelzon, A. O., & Ullman, J. D. (1982) · ACM Transactions on Database Systems · doi:10.1145/319732.319735 · Cited by 296
Database relations with null values
Zaniolo, C. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90080-1 · Cited by 263
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
- Lien, Y. E.
- Venue
- Journal of the ACM
- Published
- 1982-04
- Volume
- 29
- Issue
- 2
- Pages
- 333-362
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2057773300
- Cited by
- 225
- References
- 2
- FWCI
- 20.84
- 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: On the Equivalence of Database Models. https://app.cochat.ai/papers/10.1145/322307.322311
- The paper
- Lien, Y. E. (1982). On the Equivalence of Database Models. Journal of the ACM. https://doi.org/10.1145/322307.322311
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.