Sciweavers

18 search results - page 1 / 4
» Discovering Direct and Indirect Matches for Schema Elements
Sort
View
DASFAA
2003
IEEE
106views Database» more  DASFAA 2003»
13 years 9 months ago
Discovering Direct and Indirect Matches for Schema Elements
Automating schema matching is challenging. Previous approaches (e.g. [MBR01, DDH01]) to automating schema matching focus on computing direct element matches between two schemas. S...
Li Xu, David W. Embley
IS
2006
13 years 4 months ago
A composite approach to automating direct and indirect schema mappings
Automating schema mapping is challenging. Previous approaches to automating schema mapping focus mainly on computing direct matches between two schemas. Schemas, however, rarely m...
Li Xu, David W. Embley
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 5 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, ...
DKE
2007
199views more  DKE 2007»
13 years 4 months ago
QMatch - Using paths to match XML schemas
Integration of multiple heterogeneous data sources continues to be a critical problem for many application domains and a challenge for researchers world-wide. With the increasing ...
Naiyana Tansalarak, Kajal T. Claypool
OTM
2005
Springer
13 years 10 months ago
Semantic Schema Matching
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...