MonetDB/XQuery—Consistent and Efficient Updates on the Pre/Post Plane

  • Peter Boncz
  • Jan Flokstra
  • Torsten Grust
  • Maurice van Keulen
  • Stefan Manegold
  • Sjoerd Mullender
  • Jan Rittinger
  • Jens Teubner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3896)

Abstract

Relational XQuery processors aim at leveraging mature relational DBMS query processing technology to provide scalability and efficiency. To achieve this goal, various storage schemes have been proposed to encode the tree structure of XML documents in flat relational tables. Basically, two classes can be identified: (1) encodings using fixed-length surrogates, like the preorder ranks in the pre/post encoding [5] or the equivalent pre/size/level encoding [8], and (2) encodings using variable-length surrogates, like, e.g., ORDPATH [9] or P-PBiTree [12]. Recent research [1] showed a clear advantage of the former for efficient evaluation of XPath location steps, exploiting techniques like cheap node order tests, positional lookup, and node skipping in staircase join [7]. However, once updates are involved, variable-length surrogates are often considered the better choice, mainly as a straightforward implementation of structural XML updates using fixed-length surrogates faces two performance bottlenecks: (i) high physical cost (the preorder ranks of all nodes following the update position must be modified—on average 50% of the document), and (ii) low transaction concurrency (updating the size of all ancestor nodes causes lock contention on the document root).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boncz, P., Grust, T., Manegold, S., Rittinger, J., Teubner, J.: Pathfinder: Relational XQuery Over Multi-Gigabyte XML Input. In: Interactive Time. Technical Report INS-E0503, CWI (2005)Google Scholar
  2. 2.
    Boncz, P., Grust, T., van Keulen, M., Manegold, S., Rittinger, J., Teubner, J.: Pathfinder: XQuery—The Relational Way. In: Proc. VLDB Conf. (2005) (Demo)Google Scholar
  3. 3.
    Boncz, P., Kersten, M.L.: MIL Primitives For Querying a Fragmented World. The VLDB Journal 8(2) (1999)Google Scholar
  4. 4.
    Boncz, P., Manegold, S., Rittinger, J.: Updating the Pre/Post Plane in MonetDB/ XQuery. In: Proc. XIME-P (2005)Google Scholar
  5. 5.
    Grust, T.: Accelerating XPath Location Steps. In: Proc. SIGMOD Conf. (2002)Google Scholar
  6. 6.
    Grust, T., Sakr, S., Teubner, J.: XQuery on SQL Hosts. In: Proc. VLDB Conf. (2004)Google Scholar
  7. 7.
    Grust, T., Keulen, M.v., Teubner, J.: Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps. In: Proc. VLDB Conf. (2003)Google Scholar
  8. 8.
    Grust, T., van Keulen, M., Teubner, J.: Accelerating XPath evaluation in Any RDBMS. ACM Trans. on Database Systems 29(1) (2004)Google Scholar
  9. 9.
    O’Neil, P.E., O’Neil, E.J., Pal, S., Cseri, I., Schaller, G., Westbury, N.: ORDPATH: Insert-Friendly XML Node Labels. In: Proc. SIGMOD Conf. (2004)Google Scholar
  10. 10.
    Peyton-Jones, S., Wadler, P.: Imperative Functional Programming. In: Proc. POPL Conf. (1993)Google Scholar
  11. 11.
    Sur, G.M., Hammer, J., Simeon, J.: UpdateX - An XQuery-Based Language for Processing Updates in XML. In: Proc. PLAN-X (2004)Google Scholar
  12. 12.
    Xu Yu, J., Luo, D., Meng, X., Lu, H.: Dynamically Updating XML Data: Numbering Scheme Revisited. World Wide Web Consortium 8(1) (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Peter Boncz
    • 1
  • Jan Flokstra
    • 3
  • Torsten Grust
    • 2
  • Maurice van Keulen
    • 3
  • Stefan Manegold
    • 1
  • Sjoerd Mullender
    • 1
  • Jan Rittinger
    • 2
  • Jens Teubner
    • 2
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.Technische Universität MünchenGermany
  3. 3.University of TwenteThe Netherlands

Personalised recommendations