Please use this identifier to cite or link to this item:
Title: XR-Tree: Indexing XML data for efficient structural joins
Authors: Jiang, H.
Lu, H.
Wang, W.
Ooi, B.C. 
Issue Date: 2003
Citation: Jiang, H.,Lu, H.,Wang, W.,Ooi, B.C. (2003). XR-Tree: Indexing XML data for efficient structural joins. Proceedings - International Conference on Data Engineering : 253-264. ScholarBank@NUS Repository.
Abstract: XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating structural relationship, specifically parent-child or ancestor-descendant relationship, between XML element sets has imposed a great challenge on efficient XML query processing. This paper proposes XR-tree, namely, XML Region Tree, which is a dynamic external memory index structure specially designed for strictly nested XML data. The unique feature of XR-tree is that, for a given element, all its ancestors (or descendants) in an element set indexed by an XR-tree can be identified with optimal worst case I/O cost. We then propose a new structural join algorithm that can evaluate the structural relationship between two XR-tree indexed element sets by effectively skipping ancestors and descendants that do not participate in the join. Our extensive performance study shows that the XR-tree based join algorithm significantly outperforms previous algorithms.
Source Title: Proceedings - International Conference on Data Engineering
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Aug 4, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.