The Community for Technology Leaders
2010 11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (2007)
Haier International Training Center, Qingdao, China
July 30, 2007 to Aug. 1, 2007
ISBN: 0-7695-2909-7
pp: 756-761
Lihua Yu , Zhejiang University, China
Yijun Bei , Zhejiang University, China
Jinxiang Dong , Zhejiang University, China
Feng Shao , Zhejiang University, China
Gang Chen , Zhejiang University, China
ABSTRACT
With the proliferation of XML data on the internet, there is a large demand for efficient techniques in XML structural matching. We propose a novel filtering method, which is based on two auxiliary bitmaps named suffix bitmap and prefix bitmap, to accelerate XML structural matching. For each node in the XML document, the suffix bitmap captures in a compact format the tag name list of suffix subtree, and the prefix bitmap captures the tag name list of prefix path respectively. During the structural matching, most of unmatched node candidates can be filtered efficiently by comparing the respective bitmaps. We integrate the bitmap filtering into two categories of structural matching algorithms which are navigation-based algorithms and join-based algorithms. The experimental results demonstrate that the bitmap filtering can improve significantly the performance of XML structural matching.
INDEX TERMS
XML, Bitmap Filtering, Structural Matching.
CITATION
Lihua Yu, Yijun Bei, Jinxiang Dong, Feng Shao, Gang Chen, "Bitmap Filtering: An Efficient Speedup Method for XML Structural Matching", 2010 11th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, vol. 03, no. , pp. 756-761, 2007, doi:10.1109/SNPD.2007.376
92 ms
(Ver )