Name
Abstract | ||
|---|---|---|
Query rewriting over lightweight ontologies, like DL-Lite ontologies, is a prominent approach for ontology-based data access. It is often the case in realistic scenarios that users ask an initial query which they later refine, e.g., by extending it with new constraints making their initial request more precise. So far, all DL-Lite systems would need to process the new query from scratch. In this paper, we study the problem of computing the rewriting of an extended query by ‘extending’ a previously computed rewriting of the initial query and avoiding recomputation. Interestingly, our approach also implies a novel algorithm for computing the rewriting of a fixed query. More precisely, the query can be ‘decomposed’ into its atoms and then each atom can be processed incrementally. We present detailed algorithms, several optimisations for improving the performance of our query rewriting algorithm, and finally, an experimental evaluation. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s13740-012-0017-6 | J. Data Semantics |
Keywords | Field | DocType |
Query rewriting, DL-Lite, Incremental query rewriting, Query extension | Query optimization,Web search query,RDF query language,Query language,Programming language,Query expansion,Computer science,Sargable,Web query classification,Theoretical computer science,Object Query Language,Database | Journal |
Volume | Issue | ISSN |
3 | 1 | 1861-2040 |
Citations | PageRank | References |
24 | 0.87 | 29 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tassos Venetis | 1 | 59 | 4.95 |
| Giorgos Stoilos | 2 | 1241 | 67.47 |
| Giorgos Stamou | 3 | 1200 | 76.88 |