Query Processing in a Mediator Based Framework for Linked Data Integration

Query Processing in a Mediator Based Framework for Linked Data Integration

Vânia M. P. Vidal, José A. F. de Macêdo, João C. Pinheiro, Marco A. Casanova, Fábio Porto
DOI: 10.4018/jbdcn.2011040103
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this paper, the authors present a three-level mediator based framework for linked data integration. In the approach, the mediated schema is represented by a domain ontology, which provides a conceptual representation of the application. Each relevant data source is described by a source ontology, published on the Web according to the Linked Data principles. Each source ontology is rewritten as an application ontology, whose vocabulary is restricted to be a subset of the vocabulary of the domain ontology. The main contribution of the paper is an algorithm for reformulating a user query into sub-queries over the data sources. The reformulation algorithm exploits inter-ontology links to return more complete query results. The approach is illustrated by an example of a virtual store mediating access to online booksellers.
Article Preview
Top

2. A Framework For Linked Data Integration

In this section, we discuss the three-level architecture for linked data integration, which is depicted in Figure 1.

Figure 1.

Three-level architecture for linked data integration

jbdcn.2011040103.f01

The mediated schema is represented by a domain ontology (DO), which provides a conceptual representation of the domain (a globally shared vocabulary and a set of constraints). Each relevant data source is described by a source ontology, published on the Web according to the Linked Data principles, thereby becoming part of the Web of linked data. These source ontologies are depicted in the Web of Linked Data layer in Figure 1.

The local source schemas are accessed via wrappers, like those introduced in Berners-Lee et al. (2006) which export the local data into OWL. Each source ontology is rewritten as an application ontology (AO), whose vocabulary is restricted to be a subset of the vocabulary of the domain ontology. In Sacramento et al. (2010) we present a strategy to automatically generate such application ontologies, considering a set of local ontologies, a domain ontology and the result of the matching between each local ontology and the domain ontology. We adopt OWL Lite (Bechhofer et al., 2004) as the ontology language to represent the domain ontology, the source ontologies and the application ontologies.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2025): Forthcoming, Available for Pre-Order
Volume 19: 1 Issue (2024)
Volume 18: 2 Issues (2022): 1 Released, 1 Forthcoming
Volume 17: 2 Issues (2021)
Volume 16: 2 Issues (2020)
Volume 15: 2 Issues (2019)
Volume 14: 2 Issues (2018)
Volume 13: 2 Issues (2017)
Volume 12: 2 Issues (2016)
Volume 11: 2 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing