The DOI matches its Crossref record.
Complexity of answering queries using materialized views
Open accessAbstract
WC study the complexity of the problem of answering queries using materinlized views, This problem has attracted a lot of attention recently because of its relevance in data integration.Previous work considered only conjunctive view definitions.We examine the consequences of allowing more expressive view definition languages.Tl~olanguagcsweconsiderforviewdefinitionsanduserqueriesare: conjunctive qucrics with inequality, positive queries, datalog, and first-order logic.We show that the complexity of the problem depcnds on whether views are assumed to store all the tuples that satisfy the view definition, or only a subset of it.Finally, we apply the results to the view consistency and view self-maintainability problems which nrise in data warehousing.
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
Data exchange: semantics and query answering
Fagin, R., Kolaitis, P. G., Miller, R. J., & Popa, L. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.10.033 · Cited by 1,206
(2006) · doi:10.5555/1182635.1164130 · Cited by 553
SQL’s Three-Valued Logic and Certain Answers
Libkin, L. (2016) · ACM Transactions on Database Systems · doi:10.1145/2877206 · Cited by 83
Metadata
- Authors
- Abiteboul, S., & Duschka, O. M.
- Venue
- Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 1998-05
- Pages
- 254-263
- OpenAlex
- W2160983447
- Cited by
- 483
- References
- 0
- FWCI
- 24.04
- Type
- conference paper
- Language
- en
- Open access
- gold
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: Complexity of answering queries using materialized views. https://app.cochat.ai/papers/10.1145/275487.275516
- The paper
- Abiteboul, S., & Duschka, O. M. (1998). Complexity of answering queries using materialized views. Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. https://doi.org/10.1145/275487.275516
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.
