Complexity of Answering Queries Using Materialized Views - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2013

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.
Fichier principal
Vignette du fichier
paper.pdf (308.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00802873 , version 1 (20-03-2013)

Identifiers

  • HAL Id : hal-00802873 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More