An Efficient Index Scheme of XML Documents Using Node Range and Pre-Order List


Kim Young, Park Sang-Ho, Lee Ju-Hong, Journal of Information Processing Systems Vol. 7, No. 4, pp. 23-32, Aug. 2006  


Keywords: Indexing, Integration Path, Node Range, Pre-Order List
Fulltext:

Abstract

In this paper, we propose indexing method to manage large amount of XML documents efficiently, using the range of node and Pre-Oder List. The most of XML indexing methods are based on path or numbering method. However, the method of path-based indexing method shows disadvantages of performance degradation for join operations of ancestor-descendent relationships, and searching for middle and lower nodes. The method of numbers-scheme based indexing has to number all nodes of XML documents, since search overhead increased and the disk space for indexes was wasted. Therefore, in this paper, we propose a novel indexing method using node ranges and Preorder-Lists to overcome these problems. The proposed method more efficiently stores similar structured XML documents. In addition, our method supports flexible insertion and deletion of XML documents.


Statistics
Show / Hide Statistics

Statistics (Past 3 Years)
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
[APA Style]
Young, K., Sang-Ho, P., & Ju-Hong, L. (2006). An Efficient Index Scheme of XML Documents Using Node Range and Pre-Order List. Journal of Internet Computing and Services, 7(4), 23-32.

[IEEE Style]
K. Young, P. Sang-Ho, L. Ju-Hong, "An Efficient Index Scheme of XML Documents Using Node Range and Pre-Order List," Journal of Internet Computing and Services, vol. 7, no. 4, pp. 23-32, 2006.

[ACM Style]
Kim Young, Park Sang-Ho, and Lee Ju-Hong. 2006. An Efficient Index Scheme of XML Documents Using Node Range and Pre-Order List. Journal of Internet Computing and Services, 7, 4, (2006), 23-32.