The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Multiple-query optimization
Open accessAbstract
Some recently proposed extensions to relational database systems, as well as to deductive database systems, require support for multiple-query processing. For example, in a database system enhanced with inference capabilities, a simple query involving a rule with multiple definitions may expand to more than one actual query that has to be run over the database. It is an interesting problem then to come up with algorithms that process these queries together instead of one query at a time. The main motivation for performing such an interquery optimization lies in the fact that queries may share common data. We examine the problem of multiple-query optimization in this paper. The first major contribution of the paper is a systematic look at the problem, along with the presentation and analysis of algorithms that can be used for multiple-query optimization. The second contribution lies in the presentation of experimental results. Our results show that using multiple-query processing algorithms may reduce execution cost considerably.
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
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 5×
“We will model the optimization problem as a state space search problem and propose the use of an A* algorithm [ 21 ].”
Influential
Cited by
Processing flows of information: From data stream to complex event processing
Cugola, G., & Margara, A. (2012) · ACM Computing Surveys · doi:10.1145/2187671.2187677 · Cited by 833
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
Continual queries for Internet scale event-driven information delivery
Liu, L., Pu, C., & Tang, W. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.790816 · Cited by 332
Selection of views to materialize in a data warehouse
Gupta, H., & Mumick, I. S. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.16 · Cited by 280
Efficient LLM Serving for Agentic Workflows: A Data Systems Perspective
Wadlom, N., Shen, J., & Lu, Y. (2026) · Proceedings of the ACM on Management of Data · doi:10.1145/3802046
Metadata
- Authors
- Sellis, T. K.
- Venue
- ACM Transactions on Database Systems
- Published
- 1988-03
- Volume
- 13
- Issue
- 1
- Pages
- 23-52
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2058978608
- Cited by
- 809
- References
- 1
- FWCI
- 15.74
- 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: Multiple-query optimization. https://app.cochat.ai/papers/10.1145/42201.42203
- The paper
- Sellis, T. K. (1988). Multiple-query optimization. ACM Transactions on Database Systems. https://doi.org/10.1145/42201.42203
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.
