Texto completo
Vista Previa |
PDF (Portable Document Format)
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (928kB) | Vista Previa |
kyrie2: query rewriting under extensional constraints in ELHIO
Cita
Mora López, José, Rosati, Riccardo and Corcho, Oscar 
ORCID: https://orcid.org/0000-0002-9260-0753
(2014).
kyrie2: query rewriting under extensional constraints in ELHIO.
En: "13th International Semantic Web Conference", 19-23 Oct 2014, Riva del Garda, Italia. ISBN 978-3-319-11963-2. pp. 568-583.
https://doi.org/10.1007/978-3-319-11964-9.
ORCID: https://orcid.org/0000-0002-9260-0753
(2014).
kyrie2: query rewriting under extensional constraints in ELHIO.
En: "13th International Semantic Web Conference", 19-23 Oct 2014, Riva del Garda, Italia. ISBN 978-3-319-11963-2. pp. 568-583.
https://doi.org/10.1007/978-3-319-11964-9.
Descripción
| Título: | kyrie2: query rewriting under extensional constraints in ELHIO |
|---|---|
| Autor/es: |
|
| Tipo de Documento: | Ponencia en Congreso o Jornada (Otro) |
| Título del Evento: | 13th International Semantic Web Conference |
| Fechas del Evento: | 19-23 Oct 2014 |
| Lugar del Evento: | Riva del Garda, Italia |
| Título del Libro: | The Semantic Web – ISWC 2014 |
| Título de Revista/Publicación: | Lecture Notes in Computer Science |
| Fecha: | 2014 |
| ISBN: | 978-3-319-11963-2 |
| ISSN: | 0302-9743 |
| Volumen: | 8796 |
| Número: | null |
| Materias: | |
| ODS: | |
| Palabras Clave Informales: | Ontology-Based Data Access; Query Rewriting; Reasoning; EBox |
| Escuela: | E.T.S. de Ingenieros Informáticos (UPM) |
| Departamento: | Inteligencia Artificial |
| Licencias Creative Commons: | Reconocimiento - Sin obra derivada - No comercial |
Resumen
In this paper we study query answering and rewriting in ontologybased data access. Specifically, we present an algorithm for computing a perfect rewriting of unions of conjunctive queries posed over ontologies expressed in the description logic ELHIO, which covers the OWL 2 QL and OWL 2 EL profiles. The novelty of our algorithm is the use of a set of ABox dependencies, which are compiled into a so-called EBox, to limit the expansion of the rewriting. So far, EBoxes have only been used in query rewriting in the case of DL-Lite, which is less expressive than ELHIO. We have extensively evaluated our new query rewriting technique, and in this paper we discuss the tradeoff between the reduction of the size of the rewriting and the computational cost of our approach.
Proyectos asociados
Tipo
Código
Acrónimo
Responsable
Título
FP7
318338
OPTIQUE
Sin especificar
Scalable End-user Access to Big Data
Más información
| ID de Registro: | 35945 |
|---|---|
| Identificador DC: | https://oa.upm.es/35945/ |
| Identificador OAI: | oai:oa.upm.es:35945 |
| Identificador DOI: | 10.1007/978-3-319-11964-9 |
| URL Oficial: | http://link.springer.com/book/10.1007%2F978-3-319-... |
| Depositado por: | Memoria Investigacion |
| Depositado el: | 07 Sep 2015 11:37 |
| Ultima Modificación: | 07 Mar 2025 11:15 |
Acciones
- Estadísticas
- Exportar cita
- Editar (sólo personal del Archivo)
