.png){kind=icon}
Return
Query rewriting under query refinements
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2013.10.020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Ontologies
Description logics
Query rewriting
Query refinement
DL-Lite
EL
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more