A Path-sequence Based Method for Solving the One-to-multiple Matching Problem in Leaf-Clustering Based Approximate XML Join Algorithms
Wenxin Liang · 2006
In previous work, we have proposed approximate XML join algorithms based on the clustered leaf nodes for measuring the approximate similarity between XML documents and integrating them at the subtree classes. However, in a join loop, one base subtree may infrequently happen to be matched with multiple target ones. In this paper, we propose a path-sequence based method to solve the one-to-multiple matching problem in leaf-clustering based approximate XML join algorithms. In our method, each path sequence from the top node to the matched leaf in the base and target subtree is extracted, and the most similar target subtree for the base one is determined by the path-sequence based subtree similarity degree. We conduct experiments to evaluate our method by using both real bibliography and bioinformatics XML documents. The experimental results show that our method can eectively solve the one-to-multiple matching problem for both bibliography and bioinformatics