Dynamic interval-based labeling scheme for efficient XML query and update processing

TL;DR: A novel labeling scheme is introduced, called extended Dewey, which effectively extends the existing Dewey labeling scheme to combine the types and identifiers of elements in a label, and to avoid the scan of labels for internal query nodes to accelerate query processing (in I/O cost).

TL;DR: This paper analyzes how each approach to labeling schemes works, as well as its advantages and disadvantages, and discusses some of the current trends in labeling methods, which indicate a clear shift towards hybrid approaches.

TL;DR: This paper proposes a novel labeling scheme that not only completely avoids re-labeling but also improves the performance of determining the structural relationships when XML documents are frequently updated at arbitrary positions.

TL;DR: The GroupBased labelling scheme proposed in this thesis has a high performance in processing dynamic XML data updates, its uniform behaviour irrespective of whether the document is static or dynamic, ability to determine all structural relationships between nodes, and the improved query performance in both types of document.

TL;DR: The results suggest that contrary to most expectations, with some modifications, a native implementations in an RDBMS can support this class of query much more efficiently.

TL;DR: It is shown that, in some cases, tree-merge algorithms can have performance comparable to stack-tree algorithms, in many cases they are considerably worse, and this behavior is explained by analytical results that demonstrate that, on sorted inputs, the stack- tree algorithms have worst-case I/O and CPU complexities linear in the sum of the sizes of inputs and output, while the tree-MERge algorithms do not have the same guarantee.

TL;DR: Wang et al. as mentioned in this paper proposed a new system for indexing and storing XML data based on a numbering scheme for elements, which quickly determines the ancestor-descendant relationship between elements in the hierarchy of XML data.

TL;DR: XRel enables us to store XML documents using a fixed relational schema without any information about DTDs and also to utilize indices such as the B 1 -tree and the R-tree supported by database management systems.