Instance-Based OWL Schema Matching
Luiz André P. Paes Leme,Marco A. Casanova,Karin Breitman,Antonio L. Furtado +3 more
- 06 May 2009
- pp 14-26
TL;DR: This paper describes an instance-based schema matching technique for an OWL dialect that is based on similarity functions and is backed up by experimental results with real data downloaded from data sources found on the Web.
read more
Abstract: Schema matching is a fundamental issue in many database applications, such as query mediation and data warehousing. It becomes a challenge when different vocabularies are used to refer to the same real-world concepts. In this context, a convenient approach, sometimes called extensional, instance-based or semantic, is to detect how the same real world objects are represented in different databases and to use the information thus obtained to match the schemas. This paper describes an instance-based schema matching technique for an OWL dialect. The technique is based on similarity functions and is backed up by experimental results with real data downloaded from data sources found on the Web.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Figure 4. Translate SPARQL query from Figure 2 
Table 2. Example the same book instance representation in eBay and Amazon. 
Figure 7. Diagram of the internal database. 
Figure 5. The class instance matching algorithm. 
Figure 1. An OWL schema for a fragment of the Amazon Database. 
Figure 2. An OWL schema for a fragment of the eBay Database.
Citations
Data Integration over Distributed and Heterogeneous Data Endpoints
S.F. Cardoso de Araujo
- 04 Feb 2014
TL;DR: A novel architecture for instance matching that takes into account the particularities of this heterogeneous and distributed setting and operates even when there is no overlap between schemas, apart from a key label that matching instances must share is proposed.
Identifying candidate datasets for data interlinking
Luiz André P. Paes Leme,Giseli Rabello Lopes,Bernardo Pereira Nunes,Marco A. Casanova,Stefan Dietze +4 more
- 08 Jul 2013
TL;DR: This paper proposes a technique based on probabilistic classifiers that, given a datasets S to be published and a set T of known published datasets, ranks each Ti ∈ T according to the probability that links between S and Ti can be found by inspecting the most relevant datasets.
•Proceedings Article
Complex matching of RDF datatype properties
Bernardo Pereira Nunes,Alexander Mera,Marco A. Casanova,Karin Breitman,Luiz André P. Paes Leme +4 more
- 24 Oct 2011
TL;DR: In this article, a two-phase instance-based technique for complex datatype property matching is introduced, where the first phase is based on the identification of single property matches and the second phase is used for instance-level property matching.
30
Instance-Based Ontology Matching by Instance Enrichment
TL;DR: A method that enables IBOM to be used on two disjoint datasets, thus making it far more generically applicable, is discussed by enriching instances of each dataset with the conceptual annotations of the most similar instances from the other dataset, creating artificially dually annotated instances.
Enhanced geographically typed semantic schema matching
TL;DR: This work semantically aligns tables from respective GIS databases by first choosing attributes for comparison by combining two separate methods, and shows the effectiveness of the approach over the traditional approaches across multi-jurisdictional datasets by generating impressive results.
17
References
A relational model of data for large shared data banks
TL;DR: In this article, a model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced, and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
A survey of approaches to automatic schema matching
Erhard Rahm,Philip A. Bernstein +1 more
- 01 Dec 2001
TL;DR: A taxonomy is presented that distinguishes between schema-level and instance-level, element- level and structure- level, and language-based and constraint-based matchers and is intended to be useful when comparing different approaches to schema matching, when developing a new match algorithm, and when implementing a schema matching component.
•Journal Article
A relational model of data for large shared data banks. 1970
TL;DR: A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
3.3K
Related Papers (5)
Erhard Rahm,Philip A. Bernstein +1 more
- 01 Dec 2001
[...]
Jérôme Euzenat,Pavel Shvaiko +1 more
- 05 Jun 2007