Modeling View Selection as a Constraint Satisfaction Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Modeling View Selection as a Constraint Satisfaction Problem

(1) , (1) , (1)
1
Imene Mami
  • Function : Author
  • PersonId : 908811
Remi Coletta
  • Function : Author
  • PersonId : 932759
Zohra Bellahsene

Abstract

Using materialized views can highly speed up the query processing time. This paper deals with the view selection issue, which consists in finding a set of views to materialize that minimizes the expected cost of evaluating the query workload, given a limited amount of resource such as total view maintenance cost and/or storage space. However, the solution space is huge since it entails a large number of possible combinations of views. For this matter, we have designed a solution involving constraint programming, which has proven to be a powerful approach for modeling and solving combinatorial problems. The efficiency of our method is evaluated using workloads consisting of queries over the schema of the TPC-H benchmark. We show experimentally that our approach provides an improvement in the solution quality (i.e., the quality of the obtained set of materialized views) in term of cost saving compared to genetic algorithm in limited time. Furthermore, our approach scales well with the query workload size.
Fichier principal
Vignette du fichier
VCSPdexa.pdf (370.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00617288 , version 1 (26-08-2011)

Identifiers

Cite

Imene Mami, Remi Coletta, Zohra Bellahsene. Modeling View Selection as a Constraint Satisfaction Problem. DEXA: Database and Expert Systems Applications, Aug 2011, Toulouse, France. pp.396-410, ⟨10.1007/978-3-642-23091-2_33⟩. ⟨lirmm-00617288⟩
260 View
701 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More