The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Equivalences among Relational Expressions
Abstract
Many database queries can be formulated in terms of expressions whose operands represent tables of information (relations) and whose operators are the relational operations select, project, and join. This paper studies the equivalence problem for these relational expressions, with expression optimization in mind. A matrix, called a tableau, is proposed as a natural representative for the value of an expression. It is shown how tableaux can be made to reflect functional dependencies among attributes. A polynomial time algorithm is presented for the equivalence of tableaux that correspond to an important subset of expressions, although the equivalence problem is shown to be NP-complete under slightly more general circumstances.
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
(1979) · Cited by 43,841
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Self-citationThe complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
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
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
Optimal implementation of conjunctive queries in relational data bases
Chandra, A. K., & Merlin, P. M. (1977) · Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 · doi:10.1145/800105.803397 · Cited by 1,224
An introduction to database systems
Shneiderman, B. (1976) · Information Processing & Management · doi:10.1016/0306-4573(76)90015-7 · Cited by 1,024
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
Cited by
Data integration: a theoretical perspective
Lenzerini, M. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543644 · Cited by 2,494
Incomplete Information in Relational Databases
Imieliński, T., & Lipski, W. (1984) · Journal of the ACM · doi:10.1145/1634.1886 · Cited by 1,013
Logic and Databases: A Deductive Approach
Gallaire, H., Minker, J., & Nicolas, J.-M. (1984) · ACM Computing Surveys · doi:10.1145/356924.356929 · Cited by 733
Testing 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-citationStructure and complexity of relational queries
Chandra, A., & Harel, D. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90012-5 · Cited by 534
Complexity of answering queries using materialized views
Abiteboul, S., & Duschka, O. M. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275516 · Cited by 483
Using 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
Computable queries for relational data bases
chandra, A. K., & Harel, D. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90032-x · Cited by 437
Aho, A. V., Sagiv, Y., Szymanski, T. G., & Ullman, J. D. (1981) · SIAM Journal on Computing · doi:10.1137/0210030 · Cited by 392
Self-citationEquivalences Among Relational Expressions with the Union and Difference Operators
Sagiv, Y., & Yannakakis, M. (1980) · Journal of the ACM · doi:10.1145/322217.322221 · Cited by 369
Self-citationTesting 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
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
- Aho, A. V., Sagiv, Y., & Ullman, J. D.
- Venue
- SIAM Journal on Computing
- Published
- 1979-05
- Volume
- 8
- Issue
- 2
- Pages
- 218-246
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1975714036
- Cited by
- 365
- References
- 16
- FWCI
- 25.27
- Type
- journal article
- 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
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.