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. © Springer-Verlag 2004.
CITATION STYLE
Lam, F., Shui, W. M., Fisher, D. K., & Wong, R. K. (2004). Skipping strategies for efficient structural joins. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2973, 196–207. https://doi.org/10.1007/978-3-540-24571-1_17
Mendeley helps you to discover research relevant for your work.