Sciweavers

27 search results - page 3 / 6
» Generic Schema Matching with Cupid
Sort
View
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 7 months ago
Corpus-based Schema Matching
Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...
Jayant Madhavan, Philip A. Bernstein, AnHai Doan, ...
BTW
2009
Springer
138views Database» more  BTW 2009»
14 years 24 days ago
GEM: A Generic Visualization and Editing Facility for Heterogeneous Metadata
: 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...
Jürgen Göres, Thomas Jörg, Boris St...
CAISE
2006
Springer
13 years 10 months ago
A Tool for Semi-Automated Semantic Schema Mapping: Design and Implementation
Recently, schema mapping has found considerable interest in both research and practice. Determining matching components of database or XML schemas is needed in many applications, e...
Dimitris Manakanatas, Dimitris Plexousakis
SEMWEB
2009
Springer
14 years 23 days ago
Results of GeRoMeSuite for OAEI 2009
GeRoMeSuite is a generic model management system which provides several functions for managing complex data models, such as schema integration, definition and execution of schema ...
Christoph Quix, Sandra Geisler, David Kensche, Xia...
IBIS
2006
109views more  IBIS 2006»
13 years 6 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...