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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01556409
Contributor : Hélène Jaudoin <>
Submitted on : Wednesday, July 5, 2017 - 10:18:53 AM
Last modification on : Thursday, February 7, 2019 - 4:17:03 PM
Long-term archiving on : Tuesday, January 23, 2018 - 7:14:09 PM

File

fqas2009.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

450

Files downloads

115