Formalizing the XML schema matching problem as a constraint optimization problem

Lecture Notes in Computer Science

Volumn 3588, Issue , 2005, Pages 333-342

  Smiljanić, Marko ^a   Van Keulen, Maurice ^a   Jonker, Willem ^a,b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING; SEMANTICS; CONSTRAINED OPTIMIZATION; EXPERT SYSTEMS; FORMAL SPECIFICATION; SPECIFICATIONS; XML;

CONSTRAINT OPTIMIZATION PROBLEM; FORMAL SPECIFICATION; PROBLEM SPECIFICATION; XML SCHEMA MATCHING; CONSTRAINT OPTIMIZATION PROBLEMS; MATCHING SYSTEM; SCHEMA MATCHING; SEMANTIC SCHEMATA; TAME;

XML; PROBLEM SOLVING;

EID: 26844529698     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11546924_33     Document Type: Conference Paper

References (14)

1. R. Bartak. Constraint programming: In pursuit of the holy grail. In Proceedings of the Week of Doctoral Students (WDS), pages 555-564, June 1999.
2. A. Bergholz and J. C. Freytag. Querying Semistructured Data Based on Schema Matching. Lecture Notes in Computer Science, 1949, 2000.
3. P. A. Bernstein, S. Melnik, M. Petropoulos, and C. Quix. Industrial-strength schema matching. SIGMOD Rec., 33(4):38-43, 2004.
4. H. Do, S. Melnik, and E. Rahm. Comparison of schema matching evaluations. In Proceedings of the 2nd Int. Workshop on Web Databases, 2002.
5. H. H. Do and E. Rahm. COMA - A system for flexible combination of schema matching approaches. In P. A. Bernstein et al., editors, Proc. Intl. Conf. VLDB 2002. Morgan Kaufmann Publishers.
6. A. Doan. Learning to Map between Structured Representations of Data. PhD thesis, University of Washington, 2002.
7. B. He and K. C.-C. Chang. A holistic paradigm for large scale schema matching. SIGMOD Rec., 33(4):20-25, 2004.
8. J. Madhavan, P. A. Bernstein, P. Domingos, and A. Y. Halevy. Representing and reasoning about mappings between domain models. In Proc. Conf. (AAAI/IAAI-02), pages 80-86.
9. J. Madhavan, P. A. Bernstein, and E. Rahm. Generic schema matching with cupid. In Proceedings of the 27th International Conference on Very Large Data Bases(VLDB '01), pages 49-58, Orlando, Sept. 2001. Morgan Kaufmann.
10. K. Marriott and P. J. Stuckey. Programming with Constraints: an Introduction. MIT Press, 1998.
11. Z. Michalewicz and D. B. Fogel. How to Solve It: Modern Heuristics. Springer Verlag, December 1999.
12. E. Rahm and P. A. Bernstein. A survey of approaches to automatic schema matching. VLDB Journal: Very Large Data Bases, 10(4):334-350, Dec. 2001.
13. E. Rahm, H.-H. Do, and S. Mamann. Matching large xml schemas. SIGMOD Rec., 33(4):26-31, 2004.
14. M. Smiljanić, M. van Keulen, and W. Jonker. Defining the XML Schema Matching Problem for a Personal Schema Based Query Answering System. Technical Report TR-CTIT-04-17, Centre for Telematics and Information Technology, Apr. 2004.