The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
On the Desirability of Acyclic Database Schemes
Open accessAbstract
A class of database schemes, called acychc, was recently introduced.It is shown that this class has a number of desirable properties.In particular, several desirable properties that have been studied by other researchers m very different terms are all shown to be eqmvalent to acydicity.In addition, several equivalent charactenzauons of the class m terms of graphs and hypergraphs are given, and a smaple algorithm for determining acychclty is presented.Also given are several eqmvalent characterizations of those sets M of multivalued dependencies such that M is the set of muRlvalued dependencies that are the consequences of a given join dependency.Several characterizations for a conflict-free (in the sense of Lien) set of muluvalued dependencies are provided.
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
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
Multivalued 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-citationUsing Semi-Joins to Solve Relational Queries
Bernstein, P. A., & Chiu, D.-M. W. (1981) · Journal of the ACM · doi:10.1145/322234.322238 · Cited by 464
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-citationA 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
Self-citationBernstein, P. A., & Goodman, N. (1981) · SIAM Journal on Computing · doi:10.1137/0210059 · Cited by 226
On the Equivalence of Database Models
Lien, Y. E. (1982) · Journal of the ACM · doi:10.1145/322307.322311 · Cited by 225
Bachman, C. W. (1969) · ACM SIGMIS Database: the DATABASE for Advances in Information Systems · doi:10.1145/1017466.1017467 · Cited by 200
Independent components of relations
Rissanen, J. (1977) · ACM Transactions on Database Systems · doi:10.1145/320576.320580 · Cited by 186
An algorithm for tree-query membership of a distributed query
Yu, C., & Özsoyoğlu, M. (2005) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/cmpsac.1979.762509 · Cited by 112
Theory of relations for databases — a tutorial survey
Rissanen, J. (1978) · Lecture notes in computer science · doi:10.1007/3-540-08921-7_102 · Cited by 95
Equivalence of Relational Database Schemes
Beeri, C., Mendelzon, A. O., Sagiv, Y., et al. (1981) · SIAM Journal on Computing · doi:10.1137/0210025 · Cited by 87
Self-citationOn the Complexity of Testing Implications of Functional and Join Dependencies
Maier, D., Sagiv, Y., & Yannakakis, M. (1981) · Journal of the ACM · doi:10.1145/322276.322280 · Cited by 80
Self-citationTesting the universal instance assumption
Honeyman, P., Ladner, R. E., & Yannakakis, M. (1980) · Information Processing Letters · doi:10.1016/0020-0190(80)90114-3 · Cited by 65
Self-citationOn The Properties of Join Dependencies
Beeri, C., & Vardi, M. Y. (1981) · Springer eBooks · doi:10.1007/978-1-4615-8297-7_2 · Cited by 47
Self-citationHierarchical schemata for relational databases
Lien, Y. E. (1981) · ACM Transactions on Database Systems · doi:10.1145/319540.319546 · Cited by 46
Inferences of multivalued dependencies in fixed and undetermined universes
Biskup, J. (1980) · Theoretical Computer Science · doi:10.1016/0304-3975(80)90075-4 · Cited by 39
Decision Problems for Multivalued Dependencies in Relational Databases
Kenichi Hagihara, A., Ito, M., Taniguchi, K., et al. (1979) · SIAM Journal on Computing · doi:10.1137/0208018 · Cited by 38
Generalized Mutual Dependencies And The Decomposition Of Database Relations
Mendelzon, A. O., & Maier, D. (1979) · doi:10.1109/vldb.1979.718121 · Cited by 32
Self-citation
Cited by
(1988) · Cited by 16,582
Bayesian Networks and Decision Graphs
Jensen, F. V., & Nielsen, T. D. (2007) · Information Science and Statistics · doi:10.1007/978-0-387-68282-2 · Cited by 4,129
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Semantics and complexity of SPARQL
Pérez, J., Arenas, M., & Gutierrez, C. (2009) · ACM Transactions on Database Systems · doi:10.1145/1567274.1567278 · Cited by 1,134
Metadata
- Authors
- Beeri, C., Fagin, R., Maier, D., & Yannakakis, M.
- Venue
- Journal of the ACM
- Published
- 1983-07
- Volume
- 30
- Issue
- 3
- Pages
- 479-513
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2148417962
- Cited by
- 808
- References
- 21
- FWCI
- 45.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
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.