Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

Complexity of Answering Queries Using Materialized Views

Abstract : We study the complexity of the problem of answering queries using materialized 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. The languages we consider for view definitions and user queries are: conjunctive queries with inequality, positive queries, datalog, and first-order logic. We show that the complexity of the problem depends 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 arise in data warehousing.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [41 references]  Display  Hide  Download
Contributor : Serge Abiteboul Connect in order to contact the contributor
Submitted on : Wednesday, March 20, 2013 - 3:27:56 PM
Last modification on : Friday, October 15, 2021 - 3:10:13 PM
Long-term archiving on: : Sunday, April 2, 2017 - 4:11:45 PM


Files produced by the author(s)


  • HAL Id : hal-00802873, version 1



Serge Abiteboul, Olivier Duschka. Complexity of Answering Queries Using Materialized Views. 2013. ⟨hal-00802873⟩



Record views


Files downloads