Skipping Strategies for Efficient Structural Joins

摘要

The structural join is considered a core operation in processing and optimizing XML queries. Recently, various techniques have been proposed for efficiently finding structural relationships between sets of nodes. This paper presents an adaptive algorithm for efficiently processing structural joins. In contrast to previous work, which usually relies on external index structures such as B-trees, our proposal paper does not require any such data structures. Hence, our strategy has lower overheads than previous techniques, and can be easily implemented and incorporated into any existing system. Experiments show that our method significantly outperforms previous algorithms.