Schema and ontology matching with COMA++
Authors:
Open Access
- 14 June 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 906-908
Abstract
We demonstrate the schema and ontology matching tool COMA++. It extends our previous prototype COMA utilizing a composite approach to combine different match algorithms [3]. COMA++ implements significant improvements and offers a comprehensive infrastructure to solve large real-world match problems. It comes with a graphical interface enabling a variety of user interactions. Using a generic data representation, COMA++ uniformly supports schemas and ontologies, e.g. the powerful standard languages W3C XML Schema and OWL. COMA++ includes new approaches for ontology matching, in particular the utilization of shared taxonomies. Furthermore, different match strategies can be applied including various forms of reusing previously determined match results and a so-called fragment-based match approach which decomposes a large match problem into smaller problems. Finally, COMA++ cannot only be used to solve match problems but also to comparatively evaluate the effectiveness of different match algorithms and strategies.Keywords
This publication has 7 references indexed in Scilit:
- Corpus-Based Schema Matching2005
- Matching large XML schemasACM SIGMOD Record, 2004
- Characterising measures of lexical distributional similarity2004
- Ontology mapping: the state of the artThe Knowledge Engineering Review, 2003
- Learning to map between ontologies on the semantic web2002
- COMA — A system for flexible combination of schema matching approaches2002
- A survey of approaches to automatic schema matchingThe VLDB Journal, 2001