Abstract
A number of labeling schemes have been designed to label element nodes such that the relationship between nodes can easily be determined by comparing their labels. However, the label update cost is high in present labeling schemes. These schemes must re-label existing nodes or re-calculate certain values when inserting an order-sensitive element. In this paper, a labeling scheme is proposed to support order-sensitive update, without re-labeling or re-calculation. In experimental results, the proposed scheme efficiently processes order-sensitive queries and updates.
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.
References
Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proceedings of ACM SODA, pp. 547–556 (2001)
Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proceeding of ACM SIGMOD, pp. 253–262 (1989)
Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. In: Principles of Database Systems (PODS), pp. 271–281 (2002)
Kaplan, H., Milo, T., Shabo, R.: A comparison of labeling schemes for ancestor queries. In: Proceeding of ACM SODA, pp. 954–963 (2002)
Li, Q., Moon, B.: Indexing and querying xml data for regular path expressions. In: Proceeding of VLDB, pp. 361–370 (2001)
McHugh, J., Abiteboul, S., Goloman, R., Quass, D., Widom, J.: Lore: A database management system for semistructured data. ACM SIGMOD Record 26(3), 54–66 (1997)
Niagara project, http://www.cs.wisc.edu/niagara/
Sun. Java, http://java.sun.com/
Tatarinov, S.D.V., Beyer, K., Shanmugasundaram, J., Shekita, E., Zhang, C.: Storing and querying ordered xml using a relational database system. In: Proceeding of ACM SIGMOD, pp. 204–215 (2002)
Wu, X., Lee, M.-L., Hsu, W.: A prime number labeling scheme for dynamic ordered xml trees. In: Proceeding of ICDE, pp. 66–78 (2004)
Yoshikawa, M., Amagasa, T.: Xrel: A path-based approach to storage and retrieval of xml documents using relational databaases. In: Proceeding of ACM TOIT, pp. 110–141 (2001)
Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On supporting containment queries in relational database management systems. In: Proceeding of ACM SIGMOD, pp. 425–436 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ko, HK., Lee, S. (2006). An Efficient Scheme to Completely Avoid Re-labeling in XML Updates. In: Aberer, K., Peng, Z., Rundensteiner, E.A., Zhang, Y., Li, X. (eds) Web Information Systems – WISE 2006. WISE 2006. Lecture Notes in Computer Science, vol 4255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11912873_27
Download citation
DOI: https://doi.org/10.1007/11912873_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48105-8
Online ISBN: 978-3-540-48107-2
eBook Packages: Computer ScienceComputer Science (R0)