KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

A Minimum Sequence Matching Scheme for Efficient XPath Processing

  • Seo, Dong-Min (Department of Computer Science, Korean Advanced Institute of Science and Technology) ;
  • Yeo, Myung-Ho (Department of Computer and Communication Engineering, Chungbuk National University) ;
  • Kim, Myoung-Ho (Department of Computer Science, Korean Advanced Institute of Science and Technology) ;
  • Yoo, Jae-Soo (Department of Computer and Communication Engineering, Chungbuk National University)
  • Published : 2009.10.30
Download PDF
⟨ Previous Next ⟩

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 '//' ).

Keywords

References

  1. Q. Li and B. Moon, “Indexing and Querying XML Data for Regular Path Expressions,” Proc. of 27th VLDB Conference, pp.361-370, 2001.
  2. S. Al-Khalifa, H. V. Jagadish, N. Koudas, J. M. Patel, D. Srivastava, and Y. Wu, “Structural Joins: A Primitive for Efficient XML Query Pattern Matching,” Proc. of 18th IEEE International Conference on Data Engineering, pp.141-152, 2002.
  3. S. Y. Chien, Z. Vagena, D. Zhang, V. Tsotras, and C. Zaniolo, “Efficient Structural Joins on Indexed XML Documents,” Proc. of 28th VLDB Conference, pp.263-274, 2002.
  4. H. Wang, S. Park, W. Fan, and P. S. Yu, “ViST: A Dynamic Index Method for Querying XML Data by Tree Structures”, Proc. of 2003 ACM SIGMOD Conference, pp.110-121, 2003.
  5. E. M. McCreight, “A Space-Economical Suffix Tree Construction Algorithm,” Journal of the ACM, Vol. 23, pp.262-272, 1976. https://doi.org/10.1145/321941.321946
  6. P. Rao and B. Moon, “Sequencing XML Data and Query Twig for Fast Pattern Matching,” ACM Transactions on Database Systems(TODS), pp.299-345, 2006. https://doi.org/10.1145/1132863.1132871
  7. S. Tatikonda, S. Parthasarathy, and M. Goyder, “LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying,” Proc. of 2007 VLDB Conference, pp.63-74, 2007.
  8. C. Zhang, J. F. Naughton, D. J, DeWitt, Q. Luo, and G. M. Lohman, “On Supporting Containment Queries in Relational Database Management Systems,” Proc. of 2001 ACM SIGMOD Conference, pp.425-436, 2001.
  9. P. F. Dietz, “Maintaining Order in a Linked List,” Proc. of the 4th Annual ACM Symposium on Theory of Computing, pp.122-127, 1982.
  10. S. Tatikonada, "LCS-TRIM Project," http://www.cse.ohiostate.edu/~takidond, 2007.
  11. J. M. Hellerstein, J. F. Naughton, and A. Pfeffer, “Generalized Search Trees for Database Systems,” Proc. of the 21th VLDB Conference, pp.562-573, 1995.
  12. H. Wang, "The ViST Algorithm," http://wis.cs.uda.edu/~hxwang/pub.html, 2003.
  13. B. Moon, “PRIX Project,” http://www.cs.arizona.edu/prix, 2006.
  14. G. Miklau, “UW XML Repository,” http://www.cs.washington.edu/research/xmldatasets, 2006.