2013 | OriginalPaper | Chapter
History-Offset Implementation Scheme of XML Documents and Its Evaluations
Authors : Tatsuo Tsuji, Keita Amaki, Hiroomi Nishino, Ken Higuchi
Published in: Database Systems for Advanced Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This paper presents a novel implementation scheme of XML documents. First, we describe a labeling scheme for dynamic XML trees, in which no relabeling is necessary against the structural update of trees by the help of small auxiliary data structure. Second, two kinds of encoding/decoding data structure are proposed for implementing XML documents based on
history-offset
encoding, which is designed for encoding multidimensional datasets. One is for XML tree structure and the other is for path expressions from the root node. By cross-referencing the encoded/decoded results obtained by using these data structures, the structural retrieval using both axis specification and path expressions can be performed very efficiently. Finally, using the constructed prototype system, the performance of our implementation scheme is evaluated and compared with eXist-db, a native XMLDB system.