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

04 July 2014, 14:00 - 04 July 2014, 15:30
Salle/Bat : 445/PCRI-N
Contact :

Activités de recherche : Massively distributed algorithms for complex data

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
Langage d'icônes et visualisation d'ensembles : mé
Thursday 24 October 2019 - 14:30
Salle : 475 - PCRI-N
Jean-Baptiste Lamy .............................................

Matchings and related structures with Specified Co
Graph Theory
Thursday 17 October 2019 - 14:30
Salle : 445 - PCRI-N
Yannis Manoussakis .............................................

Conservation of structural long-range modules in R
Thursday 17 October 2019 - 14:30
Salle : 475 - PCRI-N
Vladimir Reinharz .............................................

Overcoming interference in the beeping communicati
Distributed algorithms
Friday 11 October 2019 - 14:30
Salle : 445 - PCRI-N
Fabien Dufoulon .............................................

Local checkability: a notion that started in the c
Distributed algorithms
Tuesday 08 October 2019 - 11:00
Salle : 465 - PCRI-N
Prof. Kutten Shay .............................................