• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Subtree-based XML Storage and XPath Processing

Vol. 4, No.5, October 30, 2010
10.3837/tiis.2010.10.010, Download Paper (Free):

Abstract

The state-of-the-art techniques of storing XML data, modeled as an XML tree, are node-based in the sense that they are centered around XML node labeling and the storage unit is an XML node. In this paper, we propose a generalization of such techniques so that the storage unit is an XML subtree that consists of one or more nodes. Despite several advantages with such generalization, a major problem would be inefficiency in XPath processing where the stored subtrees are to be parsed on the fly in order for the nodes inside them to be accessed. We solve this problem, proposing a technique whereby no parsing of the subtrees involved in XPath processing is needed at all unless they contain the nodes of the final query result. We prove that the correctness of XPath processing is guaranteed with our technique. Through implementation and experiments, we also show that the overhead of our technique is acceptable.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Ki Hoon Shin and Hyunchul Kang, "Subtree-based XML Storage and XPath Processing," KSII Transactions on Internet and Information Systems, vol. 4, no. 5, pp. 877-895, 2010. DOI: 10.3837/tiis.2010.10.010

[ACM Style]
Shin, K. H. and Kang, H. 2010. Subtree-based XML Storage and XPath Processing. KSII Transactions on Internet and Information Systems, 4, 5, (2010), 877-895. DOI: 10.3837/tiis.2010.10.010