Query Optimization in the Presence of Limited Access Patterns

Abstract : We consider the problem of query optimization in the presence of limitations on access patterns to the data (i.e., when one must provide v alues for one of theattributes of a relation in order to obtain tuples). We show that in the presence of limited access patterns we must search a space of {annotated query plans}, where the annotations describe the inputs that must be given to the plan. We describe a theoretical and exp erimental analysis of the resulting search space. Based on the conclusion s of this analysis, we describe a novel query optimization algorithm that is designed to perform well under the different conditions that may aris e. The algorithm searches the set of annotated query plans, pruning inval id and non-viable plans as early as possible in the search space. The alg orithm also uses a best-first search strategy in order to produce a first complete plan early in the search. We describe experiments to illustrate the performance of our algorithm.
Type de document :
[Research Report] RR-3639, INRIA. 1999
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:40:22
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:31:57



  • HAL Id : inria-00073035, version 1



Daniela Florescu, Alon Levy, Ioana Manolescu, Dan Suciu. Query Optimization in the Presence of Limited Access Patterns. [Research Report] RR-3639, INRIA. 1999. 〈inria-00073035〉



Consultations de la notice


Téléchargements de fichiers