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

A Minimum Sequence Matching Scheme for Efficient XPath Processing

Vol. 3, No. 5, October 29, 2009
10.3837/tiis.2009.05.005, Download Paper (Free):

Abstract

Index structures that are based on sequence matching for XPath processing such as ViST, PRIX and LCS-TRIM have recently been proposed to reduce the search time of XML documents. However, ViST can cause a lot of unnecessary computation and I/O when processing structural joint queries because its numbering scheme is not optimized. PRIX and LCS-TRIM require much processing time for matching XML data trees and queries. In this paper, we propose a novel index structure that solves the problems of ViST and improves the performance of PRIX and LCS-TRIM. Our index structure provides the minimum sequence matching scheme to efficiently process structural queries. Finally, to verify the superiority of the proposed index structure with the minimum sequence matching scheme, we compare our index structure with ViST, PRIX and LCS-TRIM in terms of query processing of a single path or of a branching path including wild-cards (‘*’ and ‘//’).


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]
D. Seo, M. Yeo, M. Kim and J. Yoo, "A Minimum Sequence Matching Scheme for Efficient XPath Processing," KSII Transactions on Internet and Information Systems, vol. 3, no. 5, pp. 492-506, 2009. DOI: 10.3837/tiis.2009.05.005.

[ACM Style]
Dong-min Seo, Myung-Ho Yeo, Myoung-Ho Kim, and Jae-Soo Yoo. 2009. A Minimum Sequence Matching Scheme for Efficient XPath Processing. KSII Transactions on Internet and Information Systems, 3, 5, (2009), 492-506. DOI: 10.3837/tiis.2009.05.005.