The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
Abstract
We present an algorithm for constructing a tree to satisfy a set of lineage constraints on common ancestors. We then apply this algorithm to synthesize a relational algebra expression from a simple tableau, a problem arising in the theory of relational databases.
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
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
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
The complexity of reconstructing trees from qualitative characters and subtrees
Steel, M. (1992) · Journal of Classification · doi:10.1007/bf02618470 · Cited by 508
Terraces in phylogenetic tree space
Sanderson, M. J., McMahon, M. M., & Steel, M. (2011) · Science · doi:10.1126/science.1206357 · Cited by 144
Metadata
- Authors
- Aho, A. V., Sagiv, Y., Szymanski, T. G., & Ullman, J. D.
- Venue
- SIAM Journal on Computing
- Published
- 1981-08
- Volume
- 10
- Issue
- 3
- Pages
- 405-421
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2078109763
- Cited by
- 392
- References
- 1
- FWCI
- 2.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. https://app.cochat.ai/papers/10.1137/0210030
- The paper
- Aho, A. V., Sagiv, Y., Szymanski, T. G., & Ullman, J. D. (1981). Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. SIAM Journal on Computing. https://doi.org/10.1137/0210030
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.
