Modeling View Selection as a Constraint Satisfaction Problem

Imene Mami 1, 2 Remi Coletta 2 Zohra Bellahsene 2
2 ZENITH - Scientific Data Management
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Type de document :
Communication dans un congrès
DEXA'2011: 22nd International Conference on Database and Expert Systems Applications, Toulouse, France. pp.396-410, 2011, LNCS. 〈http://www.dexa.org/〉
Liste complète des métadonnées

Littérature citée [31 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00617288
Contributeur : Imene Mami <>
Soumis le : vendredi 26 août 2011 - 17:41:37
Dernière modification le : vendredi 12 janvier 2018 - 01:55:48
Document(s) archivé(s) le : dimanche 27 novembre 2011 - 02:26:46

Fichier

VCSPdexa.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : lirmm-00617288, version 1

Citation

Imene Mami, Remi Coletta, Zohra Bellahsene. Modeling View Selection as a Constraint Satisfaction Problem. DEXA'2011: 22nd International Conference on Database and Expert Systems Applications, Toulouse, France. pp.396-410, 2011, LNCS. 〈http://www.dexa.org/〉. 〈lirmm-00617288〉

Partager

Métriques

Consultations de la notice

340

Téléchargements de fichiers

602