A New Partition-based Structural Join Algorithm
Guo Xiaodan · Jisuanji gongcheng · 2007
Efficient structural join is the key operation in XML query processing. Now, most of the structural join algorithms have poor performance because of the requirement of sorting and indexing and the problems of data replication and I/O overhead. A new partition-based structural join algorithm which does not need to sort and index is proposed based on analyzing some popular algorithms. It utilizes the stack to avoid replication and improves the I/O performance by considering the memory buffers. The experimental analysis shows that the algorithm can support query processing efficiently.