Sciweavers

Share
EDBTW
2004
Springer

L-Tree: A Dynamic Labeling Structure for Ordered XML Data

10 years 3 months ago
L-Tree: A Dynamic Labeling Structure for Ordered XML Data
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses on efficient XML query processing, XML databases also need to support efficient updates. To speed up query processing, various labeling schemes have been proposed. However, the vast majority of these schemes have poor update performance. In this paper, we introduce a dynamic labeling structure for XML data: L-Tree and its order-preserving labeling scheme with O(log n) amortized update cost and O(log n) bits per label. L-Tree has good performance on updates without compromising the performance of query processing. We present the update algorithm for L-Tree and analyze its complexity.
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where EDBTW
Authors Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sriram Padmanabhan
Comments (0)
books