Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bohannon, P., Freire, J., Roy, P., Simeon, J.: From XML-Schema to Relations: A Cost-Based Approach to XML Storage. In: Proc. ICDE (2002)
Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: Optimal XML pattern matching. In: ACM SIGMOD (2002)
Chen, Y., Davidson, S., Hara, C., Zheng, Y.: RRXS: Redundancy reducing XML storage in relations. In: Proc. VLDB (2003)
Chen, Y., Mihaila, G., Padmanabhan, S., Bordawekar, R.: Labeling your XML. Technical report, 10 (2002)
Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. In: ACM PODS (June 2002)
Uemura, S., Kha, D.D., Yoshikawa, M.: An XML Indexing Structure with Relative Region Coordinate. In: Proc. of the 17th ICDE, pp. 313–320 (2001)
DeHaan, D., Toman, D., Consens, M., Ozsu, M.T.: A comprehensive XQuery to SQL translation using dynamic interval encoding. In: ACM SIGMOD (2001)
Dietz, P.F.: Maintaining order in a linked list. In: Proc. 14th ACM STOC, pp. 62–69 (1982)
Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. In: Proc. 19th ACM STOC, pp. 365–372. Springer, Heidelberg (1987)
Dietz, P., Seiferas, J., Zhang, J.: A tight lower bound for on-line monotonic list labeling. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol. 824, pp. 131–142. Springer, Heidelberg (1994)
Florescu, D., Kossmann, D.: Storing and querying XML data using RDMBS. IEEE Data Engineering Bulletin 22(3), 27–34 (1999)
Grust, T.: Accelerating XPath location steps. In: ACM SIGMOD (2002)
Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: VLDBJ, pp. 361–370 (2001)
Shanmugasundaram, J., Tufte, K., Zhang, C., He, G., DeWitt, D.J., Naughton, J.F.: Relational databases for querying XML documents: Limitations and opportunities. In: VLDBJ, pp. 302–314 (1999)
Tatarinov, I., Viglas, E., Beyer, K., Shanmugasundaram, J., Shekita, E., Zhang, C.: Storing and querying ordered XML using a relational database system. In: ACM SIGMOD (2002)
Tsakalidis, A.K.: Maintaining order in a generalized link list. Acta Informatica 21 (1984)
Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On supporting containment queries in relational database management systems. In: ACM SIGMOD (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y., Mihaila, G., Bordawekar, R., Padmanabhan, S. (2004). L-Tree: A Dynamic Labeling Structure for Ordered XML Data. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds) Current Trends in Database Technology - EDBT 2004 Workshops. EDBT 2004. Lecture Notes in Computer Science, vol 3268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30192-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-30192-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23305-3
Online ISBN: 978-3-540-30192-9
eBook Packages: Computer ScienceComputer Science (R0)