Ranking Approximate Query Rewritings Based on Views - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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.
Fichier principal
Vignette du fichier
fqas2009.pdf (210.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01556409 , version 1 (05-07-2017)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More