Engineering optimisations in query rewriting for OBDA
Data(s) |
2013
|
---|---|
Resumo |
Ontology-based data access (OBDA) systems use ontologies to provide views over relational databases. Most of these systems work with ontologies implemented in description logic families of reduced expressiveness, what allows applying efficient query rewriting techniques for query answering. In this paper we describe a set of optimisations that are applicable with one of the most expressive families used in this context (ELHIO¬). Our resulting system exhibits a behaviour that is comparable to the one shown by systems that handle less expressive logics. |
Formato |
application/pdf |
Identificador | |
Idioma(s) |
eng |
Publicador |
E.T.S. de Ingenieros Informáticos (UPM) |
Relação |
http://oa.upm.es/37884/1/37884_INVE_MEM_2013_205697.pdf http://dl.acm.org/citation.cfm?id=2506188 TIN2010-17060 |
Direitos |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess |
Fonte |
SEMANTICS '13: proceedings of the 9th International Conference on Semantic Systems | 9th International Conference on Semantic Systems | 04-06 Sep 2013 | Graz, Austria |
Palavras-Chave | #Informática |
Tipo |
info:eu-repo/semantics/conferenceObject Ponencia en Congreso o Jornada PeerReviewed |