publications:
- title: "MonetDB/XQuery-Consistent and Efficient Updates on the Pre/Post Plane"
  author:
  - name: "Peter A. Boncz"
    link: "http://homepages.cwi.nl/~boncz/"
  - name: "Jan Flokstra"
    link: "http://wwwhome.cs.utwente.nl/~flokstra/"
  - name: "Torsten Grust"
    link: "http://www-db.informatik.uni-tuebingen.de/team/grust"
  - name: "Maurice van Keulen"
    link: "http://www.vf.utwente.nl/~keulen/"
  - name: "Stefan Manegold"
    link: "http://homepages.cwi.nl/~manegold/"
  - name: "K. Sjoerd Mullender"
    link: "http://homepages.cwi.nl/~sjoerd/"
  - name: "Jan Rittinger"
    link: "http://www-db.informatik.uni-tuebingen.de/team/rittinger"
  - name: "Jens Teubner"
    link: "http://people.inf.ethz.ch/jteubner/"
  year: "2006"
  doi: "http://dx.doi.org/10.1007/11687238_89"
  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). In [4], we presented techniques that allow an efficient and ACID-compliant implementation of XML updates also on the pre/post (respectively pre/size/level encoding) without sacrificing its superior XPath (i.e., read-only) performance. This demonstration describes in detail, how we successfully implemented these techniques in MonetDB/XQuery [2, 1],	an XML database system	with	full-fledged XQuery support. The system consists of the Pathfinder compiler that translates and optimizes XQuery into relational algebra [6], on top of the high-performance MonetDB relational database engine [3]."
  links:
    doi: "http://dx.doi.org/10.1007/11687238_89"
  tags:
  - "optimization"
  - "XQuery"
  - "translation"
  - "relational database"
  - "XML"
  - "XML Schema"
  - "process algebra"
  - "XPath"
  - "testing"
  - "relational algebra"
  - "compiler"
  - " algebra"
  - "database"
  researchr: "https://researchr.org/publication/BonczFGKMMRT06"
  cites: 0
  citedby: 0
  pages: "1190-1193"
  booktitle: "edbt"
  kind: "inproceedings"
  key: "BonczFGKMMRT06"