The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A simplied universal relation assumption and its properties
Open accessAbstract
One problem concerning the universal relation assumption is the inability of known methods to obtain a database scheme design in the general case, where the real-world constraints are given by a set of dependencies that includes embedded multivalued dependencies. We propose a simpler method of describing the real world, where constraints are given by functional dependencies and a single join dependency. The relationship between this method of defining the real world and the classical methods is exposed. We characterize in terms of hypergraphs those multivalued dependencies that are the consequence of a given join dependency. Also characterized in terms of hypergraphs are those join dependencies that are equivalent to a set of multivalued dependencies.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
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
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
Aho, A. V., & Ullman, J. D. (1977) · International Linear Collider · Cited by 1,003
Self-citationOn 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
Self-citationMultivalued dependencies and a new normal form for relational databases
Fagin, R. (1977) · ACM Transactions on Database Systems · doi:10.1145/320557.320571 · Cited by 712
Self-citationTesting 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
Self-citationSynthesizing third normal form relations from functional dependencies
Bernstein, P. A. (1976) · ACM Transactions on Database Systems · doi:10.1145/320493.320489 · Cited by 448
The theory of joins in relational databases
Aho, A. V., Beeri, C., & Ullman, J. D. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320091 · Cited by 423
Self-citation
Cited by
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
Worst-case optimal join algorithms: [extended abstract]
Ngo, H. Q., Porat, E., Ré, C., & Rudra, A. (2012) · Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems · doi:10.1145/2213556.2213565 · Cited by 324
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
- Fagin, R., Mendelzon, A. O., & Ullman, J. D.
- Venue
- ACM Transactions on Database Systems
- Published
- 1982-09
- Volume
- 7
- Issue
- 3
- Pages
- 343-360
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2039610696
- Cited by
- 296
- References
- 18
- FWCI
- 52.10
- 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 simplied universal relation assumption and its properties. https://app.cochat.ai/papers/10.1145/319732.319735
- The paper
- Fagin, R., Mendelzon, A. O., & Ullman, J. D. (1982). A simplied universal relation assumption and its properties. ACM Transactions on Database Systems. https://doi.org/10.1145/319732.319735
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.
