XML Data Integration Based on Content and Structure Similarity Using Keys [chapter]

Waraporn Viyanon, Sanjay K. Madria, Sourav S. Bhowmick
2008 Lecture Notes in Computer Science  
This paper proposes a technique for approximately matching XML data based on the content and structure by detecting the similarity of subtrees clustered semantically using leaf-node parents. The leaf-node parents are considered as a root of a subtree which is then recursively traversed bottom-up for matching. First, we take advantage of the "key" for matching subtrees which reduces the number of comparisons dramatically. Second, we measure the similarity degree based on data and structures of
more » ... e two XML documents. The results show that our approach finds much more accurate matches with or without the presence of keys in XML subtrees. Other approaches experience problems with similarity matching thresholds as they either ignore semantic information available or have problems in handling complex XML data.
doi:10.1007/978-3-540-88871-0_35 fatcat:evmlsnddqbfarkphvdvppke3j4