CSDL Home I ICDEW 2006 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)
Apr. 3, 2006 to Apr. 7, 2006
Wenxin Liang , Tokyo Institute of Technology, Japan
Haruo Yokota , Tokyo Institute of Technology, Japan
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDEW.2006.15
In this paper, we discuss the one-to-multiple matching problem in leaf-clustering based approximate XML join algorithms and propose a path-sequence based discrimination method to solve this problem. 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 pathsequence 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 effectively decrease the occunence rate of one-to-multiple matching for both bibliography and bioinformatics XML data, and hence improve the precision of the leaf-clustering based approximate XML join algorithms.
Wenxin Liang, Haruo Yokota, "A Path-sequence Based Discrimination for Subtree Matching in Approximate XML Joins", ICDEW, 2006, 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW), 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW) 2006, pp. x116, doi:10.1109/ICDEW.2006.15