Acrophile: an automated acronym extractor and server
DL '00 Proceedings of the fifth ACM conference on Digital libraries
Reconciling schemas of disparate data sources: a machine-learning approach
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Using Compression to Identify Acronyms in Text
DCC '00 Proceedings of the Conference on Data Compression
Statistical schema matching across web query interfaces
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Schema Normalization for Improving Schema Matching
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Schema label normalization for improving schema matching
Data & Knowledge Engineering
| Hi-index | 0.00 |
Schema matching is a problem of finding correspondences, particularly equivalence relationships across schemas. The problem has a particular significance in integrating web repositories, as distributed databases over the web becomes increasingly popular. Most of the existing prototypes use schema level lexical information for schema matching. However, most of them perform rather poorly on real-world problems due to the abundance of abbreviations in real-world schemas. For example, none of the lexical matchers we tested would recommend a mapping of 'cnum' to 'cid', while 'customer number' and 'customer ID' are matching entities. In this work we propose a method for abbreviation expansion in schemas that facilitates lexical schema matching.