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).
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
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)
Boncz, P., Grust, T., van Keulen, M., Manegold, S., Rittinger, J., Teubner, J.: Pathfinder: XQuery—The Relational Way. In: Proc. VLDB Conf. (2005) (Demo)
Boncz, P., Kersten, M.L.: MIL Primitives For Querying a Fragmented World. The VLDB Journal 8(2) (1999)
Boncz, P., Manegold, S., Rittinger, J.: Updating the Pre/Post Plane in MonetDB/ XQuery. In: Proc. XIME-P (2005)
Grust, T.: Accelerating XPath Location Steps. In: Proc. SIGMOD Conf. (2002)
Grust, T., Sakr, S., Teubner, J.: XQuery on SQL Hosts. In: Proc. VLDB Conf. (2004)
Grust, T., Keulen, M.v., Teubner, J.: Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps. In: Proc. VLDB Conf. (2003)
Grust, T., van Keulen, M., Teubner, J.: Accelerating XPath evaluation in Any RDBMS. ACM Trans. on Database Systems 29(1) (2004)
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)
Peyton-Jones, S., Wadler, P.: Imperative Functional Programming. In: Proc. POPL Conf. (1993)
Sur, G.M., Hammer, J., Simeon, J.: UpdateX - An XQuery-Based Language for Processing Updates in XML. In: Proc. PLAN-X (2004)
Xu Yu, J., Luo, D., Meng, X., Lu, H.: Dynamically Updating XML Data: Numbering Scheme Revisited. World Wide Web Consortium 8(1) (2005)
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
Boncz, P. et al. (2006). MonetDB/XQuery—Consistent and Efficient Updates on the Pre/Post Plane. In: Ioannidis, Y., et al. Advances in Database Technology - EDBT 2006. EDBT 2006. Lecture Notes in Computer Science, vol 3896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11687238_89
Download citation
DOI: https://doi.org/10.1007/11687238_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32960-2
Online ISBN: 978-3-540-32961-9
eBook Packages: Computer ScienceComputer Science (R0)