Abstract
When a XML document is stored in a relational or native database, its tree structure is usually dissolved into various forms of interval or Dewey indexes. Besides other advantages, these loosely-coupled structures allow parallel or distributed evaluation of XPath queries.
However, when a XQuery or XSLT program produces a new XML document, its construction forms a hardly parallelizable bottleneck. In this paper, we present a method of XQuery/XSLT evaluation that directly generates Dewey-like structures representing the output of the transformation.
This approach forms an output-side counterpart of Dewey-based XPath evaluation methods and makes parallel evaluation of XQuery/XSLT programs easier.