Name
Abstract | ||
|---|---|---|
Query rewriting is a prominent technique in ontology-based data access (OBDA) applications. Roughly speaking, a rewriting of a query Q w.r.t. an ontology is another query Q' that can be directly evaluated over the data without further reference to the input ontology. In this paper, we observe that many OBDA applications could significantly benefit from precomputing rewritings for certain queries. For example, in query optimisation, materialised rewritings of frequently asked queries can be used to speed up the query reformulation process. Moreover, in systems where users have different levels of access to information, materialised rewritings for the views assigned to each user can be exploited to obtain the set of answers to the input query derivable from the assigned views. Consequently, we investigate the problem of reformulating a query given a set of materialised rewritings and present a practical algorithm. Subsequently, we use our approach to design a fully fledged query rewriting algorithm which can exploit materialised rewritings to speed up the rewriting process. Our experimental results confirm the potential of our technique in practice. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2912845.2912867 | WIMS |
Field | DocType | Citations |
Ontology (information science),Data mining,Ontology,Information retrieval,Computer science,Description logic,Semantic Web,Exploit,Rewriting,Data access,Speedup | Conference | 0 |
PageRank | References | Authors |
0.34 | 29 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandros Chortaras | 1 | 116 | 12.31 |
| Bernardo Cuenca Grau | 2 | 3651 | 221.39 |
| Giorgos Stamou | 3 | 1200 | 76.88 |
| Giorgos Stoilos | 4 | 1241 | 67.47 |