A Structural Join Algorithm Based on Improved B+ Tree Index
Hao Gui · Jisuanji gongcheng · 2005
The basic structural join is a core operation in XML query processing. Although the Stack_Tree_Desc_B+ algorithm can effectivelyskip descendants without mathces,it is not efffective in skipping ancestors.By adding the parent and next neighbour pointers among the leaf recordsof the B+ tree,the paper proposes the Stack_Tree_Desc_B+_pn algorithm. The algorithm can effectively skip both ancestors and descendants that donot participate in a join, and the experiment shows that the improved algorithm has better performance.