OBDA: Query Rewriting or Materialization? In Practice, Both!

dc.contributor.authorSequeda, Juan F.
dc.contributor.authorArenas, Marcelo
dc.contributor.authorMiranker, Daniel P.
dc.contributor.authorMika, P
dc.contributor.authorTudorache, T
dc.contributor.authorBernstein, A
dc.contributor.authorWelty, C
dc.contributor.authorKnoblock, C
dc.contributor.authorVrandecic, D
dc.contributor.authorGroth, P
dc.contributor.authorNoy, N
dc.contributor.authorJanowicz, K
dc.contributor.authorGoble, C
dc.date.accessioned2024-01-10T14:24:47Z
dc.date.available2024-01-10T14:24:47Z
dc.date.issued2014
dc.description.abstractGiven a source relational database, a target OWL ontology and a mapping from the source database to the target ontology, Ontology-Based Data Access (OBDA) concerns answering queries over the target ontology using these three components. This paper presents the development of Ultrawrap(OBDA), an OBDA system comprising bidirectional evaluation; that is, a hybridization of query rewriting and materialization. We observe that by compiling the ontological entailments as mappings, implementing the mappings as SQL views and materializing a subset of the views, the underlying SQL optimizer is able to reduce the execution time of a SPARQL query by rewriting the query in terms of the views specified by the mappings. To the best of our knowledge, this is the first OBDA system supporting ontologies with transitivity by using SQL recursion. Our contributions include: (1) an efficient algorithm to compile ontological entailments as mappings; (2) a proof that every SPARQL query can be rewritten into a SQL query in the context of mappings; (3) a cost model to determine which views to materialize to attain the fastest execution time; and (4) an empirical evaluation comparing with a state-of-the-art OBDA system, which validates the cost model and demonstrates favorable execution times.
dc.description.funderNSF
dc.description.funderMillennium Nucleus Center for Semantic Web Research
dc.description.funderFondecyt
dc.fechaingreso.objetodigital2024-05-13
dc.format.extent17 páginas
dc.fuente.origenWOS
dc.identifier.eisbn978-3-319-11964-9
dc.identifier.eissn1611-3349
dc.identifier.isbn978-3-319-11963-2
dc.identifier.issn0302-9743
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/80267
dc.identifier.wosidWOS:000347621600019
dc.information.autorucFacultad de Ingeniería; Arenas Saavedra, Marcelo Alejandro; S/I; 81488
dc.language.isoen
dc.nota.accesoSin adjunto
dc.pagina.final551
dc.pagina.inicio535
dc.publisherSPRINGER INTERNATIONAL PUBLISHING AG
dc.relation.ispartof13th International Semantic Web Conference (ISWC), OCT 19-23, 2014, Riva del Garda, ITALY
dc.rightsregistro bibliográfico
dc.subjectEXPRESSIVE POWER
dc.subjectCOMPLEXITY
dc.titleOBDA: Query Rewriting or Materialization? In Practice, Both!
dc.typecomunicación de congreso
dc.volumen8796
sipa.codpersvinculados81488
sipa.indexWOS
sipa.trazabilidadCarga SIPA;09-01-2024
Files