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.
Publication details
Cite this paper
@inproceedings{abiteboul1998complexity,
author = {Serge Abiteboul and Oliver M. Duschka},
title = {Complexity of Answering Queries Using Materialized Views},
booktitle = {Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)},
pages = {254--263},
year = {1998},
doi = {10.1145/275487.275516}
}