The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Efficient optimization of a class of relational expressions
Open accessAbstract
The design of several database query languages has been influenced by Codd's relational algebra. This paper discusses the difficulty of optimizing queries based on the relational algebra operations select, project, and join. A matrix, called a tableau, is proposed as a useful device for representing the value of a query, and optimization of queries is couched in terms of finding a minimal tableau equivalent to a given one. Functional dependencies can be used to imply additional equivalences among tableaux. Although the optimization problem is NP-complete, a polynomial time algorithm exists to optimize tableaux that correspond to an important subclass of queries.
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 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
Cited by
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
Efficiently updating materialized views
Blakeley, J. A., Larson, P.-A., & Tompa, F. W. (1986) · ACM SIGMOD Record · doi:10.1145/16856.16861 · Cited by 429
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
Metadata
- Authors
- Aho, A. V., Sagiv, Y., & Ullman, J. D.
- Venue
- ACM Transactions on Database Systems
- Published
- 1979-12
- Volume
- 4
- Issue
- 4
- Pages
- 435-454
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W1967992696
- Cited by
- 216
- References
- 2
- FWCI
- 10.48
- 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: Efficient optimization of a class of relational expressions. https://app.cochat.ai/papers/10.1145/320107.320112
- The paper
- Aho, A. V., Sagiv, Y., & Ullman, J. D. (1979). Efficient optimization of a class of relational expressions. ACM Transactions on Database Systems. https://doi.org/10.1145/320107.320112
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.