Efficient Ontology-Based Data Integration with Canonical IRIs

@inproceedings{Xiao2018EfficientOD,
  title={Efficient Ontology-Based Data Integration with Canonical IRIs},
  author={Guohui Xiao and Dag Hovland and Dimitris Bilidas and Mart{\'i}n Rezk and Martin Giese and Diego Calvanese},
  booktitle={ESWC},
  year={2018}
}
In this paper, we study how to efficiently integrate multiple relational databases using an ontology-based approach. In ontology-based data integration (OBDI) an ontology provides a coherent view of multiple databases, and SPARQL queries over the ontology are rewritten into (federated) SQL queries over the underlying databases. Specifically, we address the scenario where records with different identifiers in different databases can represent the same entity. The standard approach in this case… 

Semantic Technologies for Data Access and Integration

TLDR
This tutorial provides a general introduction to semantic technologies, and illustrates the principles underlying OBDA/I, providing insights into its theoretical foundations, and describing well-established algorithms, techniques, and tools.

Strategies and Techniques for Federated Semantic Knowledge Retrieval and Integration

TLDR
This thesis proposes MINTE, a novel semantic integration approach that solves interoperability conflicts present in heterogeneous web sources and designs a federated semantic retrieval engine named FuhSen, able to effectively integrate data from heterogeneous data sources and create an integrated knowledge graphs on-demand from a federation of web sources.

Connecting Databases and Ontologies: A Data Quality Perspective

TLDR
This work comes up with a new mapping language that is inspired by the semijoin algebra, and proves the decidability of some important reasoning problems by embedding the authors' mapping language into the guarded fragment of first-order logic.

Services for Connecting and Integrating Big Numbers of Linked Datasets

TLDR
This dissertation analyzes the research work done in the area of Linked Data Integration and proposes indexes and algorithms that can be used at large scale, and proposes techniques that include incremental and parallelized algorithms.

SNOWL model: social networks unification-based semantic data integration

TLDR
The novel SNOWL (Social Network OWL) ontology aims to provide a new social network content modeling, following the UPON Lite ontology-construction methodology, to ensure a unified access to social networks data.

Ontology-Based Data Access: A Survey

We present the framework of ontology-based data access, a semantic paradigm for providing a convenient and user-friendly access to data repositories, which has been actively developed and studied in

A Framework Uniting Ontology-Based Geodata Integration and Geovisual Analytics

TLDR
An ontology-based approach to decouple the challenges of data access and analytics is proposed, and ontologies play a central role by providing a coherent view over the heterogeneous data, and by acting as a mediator for visual analysis tasks.

Data Intelligence 203 Virtual Knowledge Graphs : An Overview of Systems and Use Cases

TLDR
This paper presents the virtual knowledge graph (VKG) paradigm for data integration and access, which replaces the rigid structure of tables with the flexibility of graphs that are kept virtual and embed domain knowledge.

Virtual Knowledge Graphs: An Overview of Systems and Use Cases

TLDR
This paper presents the virtual knowledge graph (VKG) paradigm, which replaces the rigid structure of tables with the flexibility of graphs that are kept virtual and embed domain knowledge.

References

SHOWING 1-10 OF 35 REFERENCES

Ontology-Based Integration of Cross-Linked Datasets

TLDR
This paper tackles the problem of answering SPARQL queries over virtually integrated databases, and formally treats several fundamental questions in this context: how links over database identifiers can be represented in terms of owl:sameAs statements, how to recover rewritability of SParQL into SQL lost because of owl:(sameAs), and how to check consistency.

Ontology Based Data Access in Statoil

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

TLDR
This paper presents the development of UltrawrapOBDA, an OBDA system comprising bidirectional evaluation and observes 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.

Data Integration throughDL-LiteA Ontologies

TLDR
This paper presents a comprehensive approach to, and a complete system for, ontology-based data integration, comprising a global schema, the source schema, and the mapping between the source and the global schema.

Data Integration through DL-LiteA Ontologies

TLDR
This paper presents a comprehensive approach to, and a complete system for, ontology-based data integration, and shows that even very slight extensions of the expressive abilities of the system lead beyond this complexity bound.

Ontop: Answering SPARQL queries over relational databases

We present Ontop, an open-source Ontology-Based Data Access (OBDA) system that allows for querying relational data sources through a conceptual representation of the domain of interest, provided in

Linking Data to Ontologies

TLDR
This paper presents a new ontology language, based on Description Logics, that is particularly suited to reason with large amounts of instances and a novel mapping language that is able to deal with the so-called impedance mismatch problem.

Efficient SPARQL-to-SQL with R2RML mappings

Formalisation and experiences of R2RML-based SPARQL to SQL query translation using morph

TLDR
An extension of a well-known algorithm for SPARQL to SQL translation, originally formalised for RDBMS-backed triple stores, that takes into account R2RML mappings is described and it is shown that SParQL queries can be in general evaluated as fast as the SQL queries that would have been generated by SQL experts if no R1RMLmappings had been used.

Semantics and complexity of SPARQL

TLDR
This article identifies a large class of SPARQL patterns, defined by imposing a simple and natural syntactic restriction, where the query evaluation problem can be solved more efficiently and shows that the evaluation problem is coNP-complete for well-designed patterns.