L-Tree: a Dynamic Labeling Structure for Ordered XML Data
Document Type Conference Paper
Postprint version. Published in Lecture Notes in Computer Science, Current Trends in Database Technology, Volume 3268, 2004, pages 209-218.
Publisher URL: http://springerlink.metapress.com/content/105633
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.
Date Posted: 26 June 2007
This document has been peer reviewed.