Abstract
This paper describes a matching algorithm that can find accurate matches and scales to large XML Schemas with hundreds of nodes. We model XML Schemas as labeled, unordered and rooted trees, and turn the schema matching problem into a tree matching problem. We develop a tree matching algorithm based on the concept of Approximate Common Structures. Compared with the tree edit-distance algorithm and other Schema matching systems, our algorithm is faster and more suitable for large XML Schema matching. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Wang, S., Lu, J., & Wang, J. (2005). Approximate common structures in XML Schema matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3739 LNCS, pp. 900–905). Springer Verlag. https://doi.org/10.1007/11563952_100
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
