Abbreviation expansion in schema matching and Web integration

L. Ratinov, E. Gudes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004
EditorsN. Zhong, H. Tirri, Y. Yao, L. Zhou
Pages485-490
Number of pages6
DOIs
StatePublished - 1 Dec 2004
EventProceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004 - Beijing, China
Duration: 20 Sep 200424 Sep 2004

Publication series

NameProceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004

Conference

ConferenceProceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004
Country/TerritoryChina
CityBeijing
Period20/09/0424/09/04

ASJC Scopus subject areas

  • Engineering (all)

Cite this