Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
Smiljanic, M. and van Keulen, M. and Jonker, W.
(2005)
Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem.
In: Proceedings of the 16th International Conference on Database and Expert Systems Applications (DEXA2005), 22-26 Aug 2005, Copenhagen, Denmark.
pp. 333-342.
Lecture Notes in Computer Science 3588.
Springer.
ISSN 0302-9743
ISBN 978-3-540-28566-3
Full text available as:
Official URL: http://dx.doi.org/10.1007/11546924_33  AbstractThe 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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
