ACM Home Page
Please provide us with feedback. Feedback
Schema and ontology matching with COMA++
Full text PdfPdf (312 KB)
Source International Conference on Management of Data archive
Proceedings of the 2005 ACM SIGMOD international conference on Management of data table of contents
Baltimore, Maryland
SESSION: Demonstrations: Group 2 table of contents
Pages: 906 - 908  
Year of Publication: 2005
ISBN:1-59593-060-4
Authors
David Aumueller  University of Leipzig, Leipzig, Germany
Hong-Hai Do  University of Leipzig, Leipzig, Germany
Sabine Massmann  University of Leipzig, Leipzig, Germany
Erhard Rahm  University of Leipzig, Leipzig, Germany
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 26,   Downloads (12 Months): 195,   Citation Count: 20
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1066157.1066283
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bechhofer S., R. Volz, P. Lord: Cooking the Semantic Web with the OWL API. International Semantic Web Conference (ISWC) 2003
 
2
Budanitsky A.: Lexical Semantic Relatedness and Its Application in Natural Language Processing. Tech. Report, Univ. Toronto, 1999
 
3
Do, H. H., E. Rahm: COMA - A System for Flexible Combination of Match Algorithms. VLDB 2002
 
4
5
 
6
 
7
 
8
Mena, E. et al: Managing Multiple Information Sources through Ontologies: Relationship between Vocabulary Heterogeneity and Loss of Information. Knowledge Representation Meets Databases (KRDB) 1996
 
9
Popa, L., M. Hernández, Y. Velegrakis, R. Miller: Mapping XML and Relational Schemas with Clio. ICDE 2002 (Demonstration)
10
 
11
 
12
Weeds, J., D. Weir, D. McCarthy: Characterising Measures of Lexical Distributional Similarity. Int. Conf. of Computational Linguistics (COLING) 2004

CITED BY  20
Collaborative Colleagues:
David Aumueller: colleagues
Hong-Hai Do: colleagues
Sabine Massmann: colleagues
Erhard Rahm: colleagues