In:
ACM SIGMOD Record, Association for Computing Machinery (ACM), Vol. 33, No. 3 ( 2004-09), p. 28-33
Abstract:
XML queries differ from relational queries in that the former are expressed as path expressions. The efficient handling of structural relationships has become a key factor in XML query processing. Many index-based solutions have been proposed for efficient structural join in XML queries. This work explores the state-of-the-art indexes, namely, 〈 i 〉 B 〈 /i 〉 〈 sup 〉 + 〈 /sup 〉 -tree, XB-tree and XR-tree, and analyzes how well they support XML structural joins. Experiment results indicate that all three indexes yield comparable performances for non-recursive XML data, while the XB-tree outperforms the rest for highly recursive XML data.
Type of Medium:
Online Resource
ISSN:
0163-5808
DOI:
10.1145/1031570.1031576
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
2004
detail.hit.zdb_id:
243829-X
detail.hit.zdb_id:
2051432-3
Permalink