DBScholar

Back to papers

Complexity of Answering Queries Using Materialized Views

Summary: Studies complexity of answering queries using materialized views when view/query languages extend beyond conjunctive (CQ+inequality, positive, Datalog, FO). Proves complexity depends critically on whether materialized views are assumed complete or may be partial, with consequences for view consistency and self‑maintainability. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1151
Venue
PODS
Year
1998
Pagerank
0.00024101949
Overall Rank
225 | 98.46%
DOI
10.1145/275487.275516

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{abiteboul_pods98,
        address = {New York, NY, USA},
        series = {{PODS} '98},
        title = {{Complexity of Answering Queries Using Materialized Views}},
        url = {https://dl.acm.org/doi/10.1145/275487.275516},
        doi = {10.1145/275487.275516},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Abiteboul, Serge and Duschka, Oliver M.},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 54 citing papers.

Rank Citing Paper Year Venue Pagerank
12,099 Recovering Exchanged Data 2015 PODS 5.093636e-05
12,493 XML with Incomplete Information: Models, Properties, and Query Answering 2009 PODS 5.093636e-05
12,610 Incompleteness in Information Integration 2008 VLDB 5.093636e-05
12,725 Determining Source Contribution in Integration Systems 2005 PODS 5.093636e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers