… , is how (and whether) the ordered XML data model can be efficiently supported by the unordered
… data model. This paper shows that XML's ordered data model can indeed be efficiently …

… an efficient overall order encoding strategy that preserves order of intermediate data in XML
… This strategy removes the overhead of maintaining order at the level of individual algebra …

… also investigate how XML data affects processing efficiency of … study of the four XML data
management systems we chose … XML data ie preserving the paths and the sibling orders as …

… Our results also show that constructing an XML document inside a relational engine is far more
efficient than … To order XML fragments, the XMLAGG aggregate function needs to work on …

… Basic Model: Trees The basic data model of XML is a labeled and ordered tree. Figs. 2a …
, recursion in XML data significantly increases the complexity of efficiently querying XML data. …

… We represent an XML document as a rooted ordered tree, … XML tree is shown in Figure 1
, which represents the information about publishers, subjects, and books, and will be the data …

… To sort data into document order efficiently, this paper proposes two approaches. The
first is the naive, obvious approach based on the preorder traversal of the database, with …

… map ordered XML data to relational data. To our best knowledge, there is no published
linear schema-based data mapping algorithm for mapping ordered XML data to relational data. …

… We describe a tool for compressing XML data, with applications in data exchange and … and
combines existing compressors in order to apply them to heterogeneous XML data: it uses zlib…

… Our contribution is a collection of data structures and techniques for maintaining order-based
labeling for a dynamic tree-structured XML document. We propose two I/O-efficient …