Abstract. In this paper, we propose a general model of schema matching based on the following ideas: on the one hand, a schema is viewed as a context (namely as a partial and appro...
: Schema matching is the process of identifying semantic correspondences between schemas. COMA++ is a matching prototype which uses several characteristics of schemas to determine ...
: Ontology and schema matching are well established techniques, which have been applied in various integration scenarios, e.g., web service composition and database integration. Co...
Gerti Kappel, Horst Kargl, Gerhard Kramler, Andrea...
— We propose a new approach to the problem of schema matching in relational databases that merges the hybrid and composite approach of combining multiple individual matching tech...
Discovering correspondences between schema elements is a crucial task for data integration. Most schema matching tools are semiautomatic, e.g. an expert must tune some parameters ...
: Many model management tasks, e.g., schema matching or merging, require the manual handling of metadata. Given the diversity of metadata, its many different representations and mo...
Schema heterogeneity issues often represent an obstacle for discovering coreference links between individuals in semantic data repositories. In this paper we present an approach, w...
Andriy Nikolov, Victoria S. Uren, Enrico Motta, An...
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...