The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Equivalences Among Relational Expressions with the Union and Difference Operators
Open accessAbstract
Queries in relational databases can be formulated in terms of relational expressions using the relational operations select, project, join, union, and difference The equivalence problem for these queries is studied with query optimization m mind It ts shown that testmg eqmvalence of relational expressions with the operators select, project, join, and union is complete m the class FIt of the polynomial-time hierarchy A nonprocedural representation for queries formulated by these expressions is proposed This method of query representation can be viewed as a generahzatlon of tableaux or conjunctive queries (which are used to represent expressions with only select, project, and join) Furthermore, this method is extended to queries formulated by relatmnal expressions that also contain the difference operator, provided that the project operator is not applied to subexpresstons with the difference operator A procedure for testing eqmvalence of these queries is given It ts shown that testmg containment of tableaux is a necessary step in testing equivalence of queries with union and difference Three important cases m which containment of tableaux can be tested m polynomial time are described, although the containment problem is shown to be NP-complete even for tableaux that correspond to expressions with only one project and several join operators
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
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
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
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
On the Complexity of Timetable and Multicommodity Flow Problems
Even, S., Itai, A., & Shamir, A. (1976) · SIAM Journal on Computing · doi:10.1137/0205048 · Cited by 1,057
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
Complete sets and the polynomial-time hierarchy
Wrathall, C. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90062-1 · Cited by 394
Aho, A. V., Sagiv, Y., Szymanski, T. G., & Ullman, J. D. (1981) · SIAM Journal on Computing · doi:10.1137/0210030 · Cited by 392
Self-citationDecomposition—a strategy for query processing
Wong, E., & Youssefi, K. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320479 · Cited by 387
Equivalences among Relational Expressions
Aho, A. V., Sagiv, Y., & Ullman, J. D. (1979) · SIAM Journal on Computing · doi:10.1137/0208017 · Cited by 365
Self-citationEfficient optimization of a class of relational expressions
Aho, A. V., Sagiv, Y., & Ullman, J. D. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320112 · Cited by 216
Self-citation
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
Answering queries using views: A survey
Halevy, A. Y. (2001) · The VLDB Journal · doi:10.1007/s007780100054 · Cited by 1,510
Green, T. J., Karvounarakis, G., & Tannen, V. (2007) · Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1265530.1265535 · Cited by 812
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
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
Metadata
- Authors
- Sagiv, Y., & Yannakakis, M.
- Venue
- Journal of the ACM
- Published
- 1980-10-01
- Volume
- 27
- Issue
- 4
- Pages
- 633-655
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2056660085
- Cited by
- 369
- References
- 12
- FWCI
- 9.54
- 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: Equivalences Among Relational Expressions with the Union and Difference Operators. https://app.cochat.ai/papers/10.1145/322217.322221
- The paper
- Sagiv, Y., & Yannakakis, M. (1980). Equivalences Among Relational Expressions with the Union and Difference Operators. Journal of the ACM. https://doi.org/10.1145/322217.322221
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.