Sciweavers

Share
DLOG
2011

Dependencies to Optimize Ontology Based Data Access

8 years 2 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answering techniques with DL-Lite require exponential size query reformulations, or expensive data pre-processing. Also, these techniques present severe redundancy issues when dealing with ABoxes that are already (partially) complete. It has been shown that addressing redundancy is not only required for tractable implementations of decision procedures, but may also allow for sizable improvements in execution times. Considering the previous observations, in this paper we extend the results aiming at improving query answering performance in OBDA systems that were developed in [9] for DL-LiteF , to the case where also role inclusions are present in the TBox. Specifically, we first show that we can characterize completeness of an ABox by means of dependencies, and that we can use these to optimize DL-LiteA TBoxes. Seco...
Mariano Rodriguez-Muro, Diego Calvanese
Added 27 Aug 2011
Updated 27 Aug 2011
Type Journal
Year 2011
Where DLOG
Authors Mariano Rodriguez-Muro, Diego Calvanese
Comments (0)
books