Advertisement

Reuse or Never Reuse the Deleted Labels in XML Query Processing Based on Labeling Schemes

  • Changqing Li
  • Tok Wang Ling
  • Min Hu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3882)

Abstract

To facilitate the XML query processing, several kinds of labeling schemes have been proposed. Based on the labeling schemes, the ancestor-descendant and parent-child relationships in XML queries can be quickly determined without accessing the original XML file. Recently, more researches are focused on how to update the labels when nodes are inserted into the XML. However how to process the deleted labels are not discussed previously. We think that the deleted labels can be processed in two different directions: (1) reuse all the deleted labels to control the label size increasing speed and improve the query performance; (2) never reuse the deleted labels to query different versions of the XML data based on labeling schemes. In this paper, we firstly introduce our previous work, called QED, which can completely avoid the re-labeling in XML updates. Secondly based on QED we propose a new algorithm, called Reuse, which can reuse all the deleted labels to control the label size increasing speed; meanwhile the Reuse algorithm can completely avoid the re-labeling also. Thirdly to query different versions of the XML data, we propose another new algorithm, called NeverReuse, which is the only approach that never reuses any deleted labels. Extensive experimental results show that the algorithms proposed in this paper can control the label size increasing speed when reusing all the deleted labels, and is the only approach to query different versions of the XML data based on labeling schemes.

Keywords

Label Scheme Query Performance Code Size Containment Scheme 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. In: Proc. of ACM SIGMOD, pp. 253–262 (1989)Google Scholar
  2. 2.
    Amagasa, T., Yoshikawa, M., Uemura, S.: QRS: A Robust Numbering Scheme for XML Documents. In: Proc. of ICDE, pp. 705–707 (2003)Google Scholar
  3. 3.
    Bose, S., Fegaras, L.: Data Stream Management for Historical XML Data. In: Proc. of ACM SIGMOD, pp. 239–250 (2004)Google Scholar
  4. 4.
    Chien, S., Tsotras, V.J., Zaniolo, C.: Efficient Management of Multiversion Documents by Object Referencing. In: Proc. of VLDB, pp. 291–300 (2001)Google Scholar
  5. 5.
    Chien, S.Y., Tsotras, V., Zaniolo, C., Zhang, D.: Supporting Complex Queries on Multiversion XML Documents. ACM Trans. on Office Information Systems, 1–42 (2005)Google Scholar
  6. 6.
    Cohen, E., Kaplan, H., Milo, T.: Labeling Dynamic XML Trees. In: Proc. of PODS, pp. 271–281 (2002)Google Scholar
  7. 7.
    Li, C., Ling, T.W., Hu, M.: Efficient Processing of Updates in Dynamic XML Data. In: Proc. of ICDE (to appear, 2006)Google Scholar
  8. 8.
    Li, C., Ling, T.W.: QED: A Novel Quaternary Encoding to Completely Avoid Re-labeling in XML Updates. In: Proc. of CIKM, pp. 501–508 (2005)Google Scholar
  9. 9.
    Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: Proc. of VLDB, pp. 361–370 (2001)Google Scholar
  10. 10.
    Marian, A., Abiteboul, S., Cobena, G., Mignet, L.: Change-Centric Management of Versions in an XML Warehouse. In: Prof. of VLDB, pp. 581–590 (2001)Google Scholar
  11. 11.
    McHugh, J., Abiteboul, S., Goldman, R., Quass, D., Widom, J.: Lore: A Database Management System for Semistructured Data. SIGMOD Record 26(3), 54–66 (1997)CrossRefGoogle Scholar
  12. 12.
    Nestorov, S., Ullman, J.D., Wiener, J.L., Chawathe, S.S.: Representative Objects: Concise Representations of Semistructured, Hierarchial Data. In: Prof. of ICDE, pp. 79–90 (1997)Google Scholar
  13. 13.
    O’Neil, P.E., O’Neil, E.J., Pal, S., Cseri, I., Schaller, G., Westbury, N.: ORDPATHs: Insert-Friendly XML Node Labels. In: Prof of ACM SIGMOD, pp. 903–908 (2004)Google Scholar
  14. 14.
    Silberstein, A., He, H., Yi, K., Yang, J.: BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data. In: Proc. of ICDE, pp. 285–296 (2005)Google Scholar
  15. 15.
    Tatarinov, I., Viglas, S., Beyer, K.S., Shanmugasundaram, J., Shekita, E.J., Zhang, C.: Storing and querying ordered XML using a relational database system. In: Proc. of ACM SIGMOD, pp. 204–215 (2002)Google Scholar
  16. 16.
    Wang, F., Zaniolo, C., Zhou, X., Moon, H.J.: Managing Multiversion Documents & Historical Databases: a Unified Solution Based on XML. In: Proc. of WebDB, pp. 151–153 (2005)Google Scholar
  17. 17.
    Wang, F., Zhou, X., Zaniolo, C.: An XML-Based Approach to Publishing and Querying the History of Databases. World Wide Web Journal, 1–30 (2005)Google Scholar
  18. 18.
    Wu, X., Lee, M.L., Hsu, W.: A Prime Number Labeling Scheme for Dynamic Ordered XML Trees. In: Proc. of ICDE, pp. 66–78 (2004)Google Scholar
  19. 19.
    Yoshikawa, M., Amagasa, T., Shimura, T., Uemura, S.: XRel: a path-based approach to storage and retrieval of XML documents using relational databases. ACM Trans. Internet Techn. 1(1), 110–141 (2001)CrossRefGoogle Scholar
  20. 20.
    Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On Supporting Containment Queries in Relational Database Management Systems. In: Proc. of ACM SIGMOD, pp. 425–436 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Changqing Li
    • 1
  • Tok Wang Ling
    • 1
  • Min Hu
    • 2
  1. 1.Dept. of CSNational University of SingaporeSingapore
  2. 2.Dept. of COFMNational University of SingaporeSingapore

Personalised recommendations