Database Paper Browser

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
1152
Venue
PODS
Year
1998
Pagerank
0.00028596715
Overall Rank
297 | 97.94%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 54 citing papers.

Rank Citing Paper Year Venue Pagerank
12,298 XML with Incomplete Information: Models, Properties, and Query Answering 2009 PODS 4.1945683e-05
12,416 Incompleteness in Information Integration 2008 VLDB 4.1945683e-05
12,476 Materialized Views in Probabilistic Databases 2007 VLDB 4.1945683e-05
12,532 Determining Source Contribution in Integration Systems 2005 PODS 4.1945683e-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