Abstract
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema matching. Semantic schema matching has been extensively researched, and many matching systems have been developed. However, formal specifications of problems being solved by these systems do not exist, or are partial. In this paper, we analyze the problem of semantic schema matching, identify its main components and deliver a formal specification based on the constraint optimization problem formalism. Throughout the paper, we consider the schema matching problem as encountered in the context of a large scale XML schema matching application.
Original language | English |
---|---|
Title of host publication | Database and Expert Systems Applications |
Subtitle of host publication | 16th International Conference, DEXA 2005, Copenhagen, Denmark, August 22-26, 2005. Proceedings |
Editors | Kim Viborg Andersen, John Debenham, Roland Wagner |
Place of Publication | Berlin, Germany |
Publisher | Springer |
Pages | 333-342 |
Number of pages | 10 |
ISBN (Print) | 978-3-540-28566-3 |
DOIs | |
Publication status | Published - Aug 2005 |
Event | 16th International Conference on Database and Expert Systems Applications, DEXA 2005 - Copenhagen Business School, Copenhagen, Denmark Duration: 22 Aug 2005 → 26 Aug 2005 Conference number: 16 http://www.dexa.org/previous/dexa2005/drupal/index71ca.html |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 3588 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Workshop
Workshop | 16th International Conference on Database and Expert Systems Applications, DEXA 2005 |
---|---|
Abbreviated title | DEXA |
Country | Denmark |
City | Copenhagen |
Period | 22/08/05 → 26/08/05 |
Internet address |
Keywords
- EWI-7330
- DB-PRJBF: BELLFLOWER
- IR-66453
- METIS-225758
- DB-SDI: SCHEMA AND DATA INTEGRATION