An Efficient Scheme to Completely Avoid Re-labeling in XML Updates

  • Hye-Kyeong Ko
  • SangKeun Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4255)


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.


Label Scheme Chinese Remainder Theorem Containment Scheme Sibling Node Label Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proceedings of ACM SODA, pp. 547–556 (2001)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic XML trees. In: Principles of Database Systems (PODS), pp. 271–281 (2002)Google Scholar
  4. 4.
    Kaplan, H., Milo, T., Shabo, R.: A comparison of labeling schemes for ancestor queries. In: Proceeding of ACM SODA, pp. 954–963 (2002)Google Scholar
  5. 5.
    Li, Q., Moon, B.: Indexing and querying xml data for regular path expressions. In: Proceeding of VLDB, pp. 361–370 (2001)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
  8. 8.
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hye-Kyeong Ko
    • 1
  • SangKeun Lee
    • 1
  1. 1.Department of Computer Science and EngineeringKorea UniversitySeoulSouth Korea

Personalised recommendations