EEMCS EPrints Service
Smiljanic, M. and van Keulen, M. and Jonker, W. (2006) Using Element Clustering to Increase the Efficiency of XML Schema Matching. In: Proceedings of the 22nd International Conference on Data Engineering Workshops (ICDEW 2006), 3 Apr 2006, Atlanta, Georgia. 45. IEEE Computer Society. ISBN 0-7695-2571-7
Full text available as:
Schema matching attempts to discover semantic mappings between elements of two schemas. Elements are cross compared using various heuristics (e.g., name, data-type, and structure similarity). Seen from a broader perspective, the schema matching problem is a combinatorial problem with an exponential complexity. This makes the naive matching algorithms for large schemas prohibitively inefficient. In this paper we propose a clustering based technique for improving the efficiency of large scale schema matching. The technique inserts clustering as an intermediate step into existing schema matching algorithms. Clustering partitions schemas and reduces the overall matching load, and creates a possibility to trade between the efficiency and effectiveness. The technique can be used in addition to other optimization techniques. In the paper we describe the technique, validate the performance of one implementation of the technique, and open directions for future research.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item