A Minimum Sequence Matching Scheme for Efficient XPath Processing

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 265
  • Download : 0
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 '//').
Publisher
KSII-KOR SOC INTERNET INFORMATION
Issue Date
2009-10
Language
English
Article Type
Article
Citation

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, v.3, no.5, pp.492 - 506

ISSN
1976-7277
DOI
10.3837/tiis.2009.05.005
URI
http://hdl.handle.net/10203/97036
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0