The DOI matches its Crossref record.
Query optimization in the presence of limited access patterns
Open accessAbstract
We consider the problem of query optimization in the presence of limitations on access patterns to the data (i.e., when one must provide values for one of the attributes of a relation in order to obtain tuples). We show that in the presence of limited access patterns we must search a space of annotated query plans , where the annotations describe the inputs that must be given to the plan. We describe a theoretical and experimental analysis of the resulting search space and a novel query optimization algorithm that is designed to perform well under the different conditions that may arise. The algorithm searches the set of annotated query plans, pruning invalid and non-viable plans as early as possible in the search space, and it also uses a best-first search strategy in order to produce a first complete plan early in the search. We describe experiments to illustrate the performance of our algorithm.
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
Cited by
(2006) · doi:10.5555/1182635.1164130 · Cited by 553
Efficient and extensible algorithms for multi query optimization
Roy, P., Seshadri, S., Sudarshan, S., & Bhobe, S. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335419 · Cited by 403
Model-driven development of Web applications: the AutoWeb system
Fraternali, P., & Paolini, P. (2000) · ACM Transactions on Information Systems · doi:10.1145/358108.358110 · Cited by 160
Metadata
- Authors
- Florescu, D., Levy, A., Manolescu, I., & Suciu, D.
- Venue
- ACM SIGMOD Record
- Published
- 1999-06
- Volume
- 28
- Issue
- 2
- Pages
- 311-322
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2084761702
- Cited by
- 164
- References
- 0
- FWCI
- 24.17
- Type
- journal article
- Language
- en
- Open access
- green
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: Query optimization in the presence of limited access patterns. https://app.cochat.ai/papers/10.1145/304181.304210
- The paper
- Florescu, D., Levy, A., Manolescu, I., & Suciu, D. (1999). Query optimization in the presence of limited access patterns. ACM SIGMOD Record. https://doi.org/10.1145/304181.304210
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.
