scispace - formally typeset
Search or ask a question
JournalISSN: 1861-2032

Journal on Data Semantics 

Springer Science+Business Media
About: Journal on Data Semantics is an academic journal. The journal publishes majorly in the area(s): Ontology (information science) & Semantic Web. It has an ISSN identifier of 1861-2032. Over the lifetime, 241 publications have been published receiving 8203 citations.


Papers
More filters
Book ChapterDOI
TL;DR: This paper presents a new classification of schema-based matching techniques that builds on the top of state of the art in both schema and ontology matching and distinguishes between approximate and exact techniques at schema-level; and syntactic, semantic, and external techniques at element- and structure-level.
Abstract: Schema and ontology matching is a critical problem in many application domains, such as semantic web, schema/ontology integration, data warehouses, e-commerce, etc. Many different matching solutions have been proposed so far. In this paper we present a new classification of schema-based matching techniques that builds on the top of state of the art in both schema and ontology matching. Some innovations are in introducing new criteria which are based on (i) general properties of matching techniques, (ii) interpretation of input information, and (iii) the kind of input information. In particular, we distinguish between approximate and exact techniques at schema-level; and syntactic, semantic, and external techniques at element- and structure-level. Based on the classification proposed we overview some of the recent schema/ontology matching systems pointing which part of the solution space they cover. The proposed classification provides a common conceptual basis, and, hence, can be used for comparing different existing schema/ontology matching techniques and systems as well as for designing new ones, taking advantages of state of the art solutions.

1,285 citations

Book ChapterDOI
TL;DR: 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.
Abstract: Many organizations nowadays face the problem of accessing existing data sources by means of flexible mechanisms that are both powerful and efficient. Ontologies are widely considered as a suitable formal tool for sophisticated data access. The ontology expresses the domain of interest of the information system at a high level of abstraction, and the relationship between data at the sources and instances of concepts and roles in the ontology is expressed by means of mappings. In this paper we present a solution to the problem of designing effective systems for ontology-based data access. Our solution is based on three main ingredients. First, we present a new ontology language, based on Description Logics, that is particularly suited to reason with large amounts of instances. The second ingredient is a novel mapping language that is able to deal with the so-called impedance mismatch problem, i.e., the problem arising from the difference between the basic elements managed by the sources, namely data, and the elements managed by the ontology, namely objects. The third ingredient is the query answering method, that combines reasoning at the level of the ontology with specific mechanisms for both taking into account the mappings and efficiently accessing the data at the sources.

884 citations

Journal Article
TL;DR: In this article, the authors extend Description Logics with the ability to handle complex mappings between domains, through the use of so-called bridge rules, and investigate, among others, the exploitation of bridge rules to deduce new information, especially subsumption relationships between concepts in local information sources.
Abstract: Due to the availability on the Internet of a wide variety of sources of information on related topics, the problem of providing seamless, integrated access to such sources has become (again) a major research challenge. Although this problem has been studied for several decades, there is a need for a more refined approach in those cases where the original sources maintain their own independent view of the world. In particular, we investigate those situations where there may not be a simple one-to-one mapping between the individuals in the domains of the various Information Sources. Since Description Logics have already served successfully in information integration and as ontology languages, we extend this formalism with the ability to handle complex mappings between domains, through the use of so-called bridge rules. We investigate, among others, the exploitation of bridge rules to deduce new information, especially subsumption relationships between concepts in local information sources.

294 citations

Book ChapterDOI
TL;DR: This paper reports results and lessons learned from the Ontology Alignment Evaluation Initiative (OAEI), a benchmarking initiative for ontology matching, and describes the evaluation design used in the OAEI campaigns in terms of datasets, evaluation criteria and workflows.
Abstract: In the area of semantic technologies, benchmarking and systematic evaluation is not yet as established as in other areas of computer science, e.g., information retrieval. In spite of successful attempts, more effort and experience are required in order to achieve such a level of maturity. In this paper, we report results and lessons learned from the Ontology Alignment Evaluation Initiative (OAEI), a benchmarking initiative for ontology matching. The goal of this work is twofold: on the one hand, we document the state of the art in evaluating ontology matching methods and provide potential participants of the initiative with a better understanding of the design and the underlying principles of the OAEI campaigns. On the other hand, we report experiences gained in this particular area of semantic technologies to potential developers of benchmarking for other kinds of systems. For this purpose, we describe the evaluation design used in the OAEI campaigns in terms of datasets, evaluation criteria and workflows, provide a global view on the results of the campaigns carried out from 2005 to 2010 and discuss upcoming trends, both specific to ontology matching and generally relevant for the evaluation of semantic technologies. Finally, we argue that there is a need for a further automation of benchmarking to shorten the feedback cycle for tool developers.

290 citations

Book ChapterDOI
TL;DR: Semantic matching as discussed by the authors is an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other.
Abstract: We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on two ideas: (i) we discover mappings by computing semantic relations (e.g., equivalence, more general); (ii) we determine semantic relations by analyzing the meaning (concepts, not labels) which is codified in the elements and the structures of schemas. In this paper we present basic and optimized algorithms for semantic matching, and we discuss their implementation within the S-Match system. We evaluate S-Match against three state of the art matching systems, thereby justifying empirically the strength of our approach.

280 citations

Network Information
Related Journals (5)
Knowledge and Information Systems
2K papers, 72.5K citations
84% related
ACM Transactions on Database Systems
958 papers, 105K citations
83% related
IEEE Transactions on Knowledge and Data Engineering
5.2K papers, 365.2K citations
81% related
Sigkdd Explorations
485 papers, 69K citations
80% related
ACM Computing Surveys
2.4K papers, 395.7K citations
80% related
Performance
Metrics
No. of papers from the Journal in previous years
YearPapers
202118
20209
201913
201812
201713
201616