Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) LaHDAK
Complete Yet Practical Search For Minimal Query Reformulations Under Constraints
Ioana Ileana

04 July 2014, 14h00 - 04 July 2014, 15h30
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche : Algorithmes pour les grands volumes de données distribuées

Résumé :
We revisit the Chase & Backchase algorithm for query reformulations under constraints. For an important class of queries and constraints, C&B has been shown to be complete, i.e. guaranteed to find all (join-)minimal reformulations under constraints. C & B is based on constructing a canonical rewriting candidate called a universal plan, then inspecting its exponentially many sub-queries in search for minimal reformulations, essentially removing redundant joins in all possible ways. This inspection involves chasing the subquery. Because of the resulting exponentially many chases, the conventional wisdom has held that completeness is a concept of mainly theoretical interest.

We show that completeness can be preserved at practically relevant cost by introducing Provenance-Aware Chase & Backchase, a novel reformulation algorithm that instruments the chase to maintain provenance information connecting the joins added during the chase to the universal plan subqueries responsible for adding these joins. This allows it to directly "read off" the minimal reformulations from the result of a single chase of the universal plan, saving exponentially many chases of its subqueries. We exhibit natural scenarios yielding speedups of over two orders of magnitude between the execution of the best view-based rewriting found by a commercial query optimizer and that of the best rewriting found by Prov C&B (which the optimizer misses because of limited reasoning about constraints)."

Joint work with Bogdan Cautis, Alin Deutsch, and Yannis Katsis.

Pour en savoir plus :
Séminaires
Portable vectorization and parallelization of C++
Calcul à haute performance
Tuesday 19 December 2017 - 10h30
Salle : 465 - PCRI-N
Laurent Plagne .............................................

Approximate Bayesian Computation and Random Forest
Thursday 14 December 2017 - 14h30
Salle : 465 - PCRI-N
Valentin Thouzeau .............................................

Cycles dans les produits cartésiens de graphes
Théorie des graphes
Friday 01 December 2017 - 14h30
Salle : 455 - PCRI-N
Evelyne Flandrin .............................................

SBGNlog: a logical framework based on SBGN to reas
Thursday 30 November 2017 - 14h30
Salle : 435 - PCRI-N
Adrien Rougny .............................................

Parsimony meets our understanding of recent human
Thursday 23 November 2017 - 14h30
Salle : 435 - PCRI-N
Luca Pagani .............................................