An Efficient Index Structure for Bottom-Up Query Processing of XML Documents


Seo Dong-Min, Kim Eun-Jae, Seong Dong-Ook, Yoo Jae-Soo, Cho Ki-Hyung, Journal of Information Processing Systems Vol. 7, No. 4, pp. 101-114, Aug. 2006  


Fulltext:

Abstract

A path query is used in XML. Several index structures have been studied for processing the path query efficiently. In recent. the index schemes using suffix tree with structure join method were proposed. ViST is the most representative method among such methods. ViST processes the query using suffix tree and uses B+-tree to reduce the search time of the documents. However, it significantly degrades the search performance when processing the path query. The reason is that it regards the element that is not ancestor-descendant relation in the document as a descendent. In this paper, we propose an efficient index structure to solve the problem of ViST. The query processing method suitable to the index structure is also proposed. It is shown through various experiments that the proposed index structure outperforms the existing index structure in terms of the query processing time.


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]
Dong-Min, S., Eun-Jae, K., Dong-Ook, S., Jae-Soo, Y., & Ki-Hyung, C. (2006). An Efficient Index Structure for Bottom-Up Query Processing of XML Documents. Journal of Internet Computing and Services, 7(4), 101-114.

[IEEE Style]
S. Dong-Min, K. Eun-Jae, S. Dong-Ook, Y. Jae-Soo, C. Ki-Hyung, "An Efficient Index Structure for Bottom-Up Query Processing of XML Documents," Journal of Internet Computing and Services, vol. 7, no. 4, pp. 101-114, 2006.

[ACM Style]
Seo Dong-Min, Kim Eun-Jae, Seong Dong-Ook, Yoo Jae-Soo, and Cho Ki-Hyung. 2006. An Efficient Index Structure for Bottom-Up Query Processing of XML Documents. Journal of Internet Computing and Services, 7, 4, (2006), 101-114.