Paper Info
Title
Query rewriting under query refinements
Abstract
Ontologies expressed in description logics or extensions of datalog are gradually used for describing the domain of many research and industrial strength applications. They provide a formal semantically rich and data-independent layer over which user queries can be posed. A prominent technique for query answering in ontology-based applications is query rewriting, where the given user query Q and ontology O are transformed into a (datalog) program R that captures the answers of Q over O and every database D. In realistic scenarios it is quite often the case that users refine their original query by adding or removing constraints until they produce a final one. In such scenarios, however, all existing systems would compute a new rewriting R"i for each refined query Q"i from scratch, discarding any information possibly computed previously. In this paper we study the problem of computing a rewriting for a query Q^' which is a ''refinement'' of a query Q by exploiting as much as possible information possibly computed previously for Q. We investigate whether such information is usable when computing a rewriting for Q^' and present detailed algorithms. Finally, we have implemented all proposed algorithms and conducted an extensive experimental evaluation.
Year
DOI
Venue
2014
10.1016/j.knosys.2013.10.020
Knowl.-Based Syst.
Keywords
Field
DocType
possible information,ontology o,refined query,program r,original query,query refinement,data-independent layer,user query,user query q,query answering,query q,ontologies,description logics
Query optimization,Web search query,Query language,RDF query language,Programming language,Query expansion,Computer science,Sargable,Web query classification,Theoretical computer science,Ranking (information retrieval)
Journal
Volume
ISSN
Citations 
56,
0950-7051
0
PageRank 
References 
Authors
0.34
31
3
Name
Order
Citations
PageRank
Tassos Venetis1594.95
Giorgos Stoilos2124167.47
Giorgos Stamou3120076.88