Sound, complete and minimal UCQ-rewriting for existential rules
2015; IOS Press; Volume: 6; Issue: 5 Linguagem: Inglês
10.3233/sw-140153
ISSN2210-4968
AutoresMélanie König, Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo,
Tópico(s)Data Management and Algorithms
ResumoWe address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog±. A well-known approach involves rewriting the query using ontological knowledge. We focus here on the basic rewriting technique which consists of rewriting t he initial query into a union of conjunctive queries. First, we study a generic breadth-first rewriting algorithm, which takes any rewriting operator as a parameter, and define properties of rewriting operators that ensure the correctness of the algorithm. Then, we focus on piece-unifiers, which provide a rewriting operator with the desired properties. Finally, we propose an implementation of this framework and report some experiments.
Referência(s)