Ranking Approximate Query Rewritings Based on Views

Abstract : This paper considers the problem of rewriting queries using views by means of a tolerant method. The approach proposed is based on an approximate matching between the constraints from the query and those from the views, in the case where both the query and the views contain arithmetical constraints expressed as intervals. In such a context, the answers obtained are not certain anymore but only more or less probable. An algorithm which retrieves the top-k rewritings of a given query is described. Experimentations are reported, which show that the extra cost induced by the approximate nature of the rewriting process is perfectly acceptable.
Type de document :
Communication dans un congrès
FQAS, Oct 2009, Roskilde, Denmark. pp.13 - 24, 2009, <10.1007/978-3-642-04957-6_2>
Liste complète des métadonnées


https://hal.inria.fr/hal-01556409
Contributeur : Hélène Jaudoin <>
Soumis le : mercredi 5 juillet 2017 - 10:18:53
Dernière modification le : mercredi 2 août 2017 - 10:11:06

Fichier

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

Identifiants

Citation

Hélène Jaudoin, Pierre Colomb, Olivier Pivert. Ranking Approximate Query Rewritings Based on Views. FQAS, Oct 2009, Roskilde, Denmark. pp.13 - 24, 2009, <10.1007/978-3-642-04957-6_2>. <hal-01556409>

Partager

Métriques

Consultations de
la notice

131

Téléchargements du document

17