Journal of Northeastern University ›› 2005, Vol. 26 ›› Issue (6): 535-537.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Optimizing common sub-queries in XML data for regular path expressions

Han, Dong-Hong (1); Wang, Guo-Ren (1); Qiao, Bai-You (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2005-06-15 Published:2013-06-24
  • Contact: Han, D.-H.
  • About author:-
  • Supported by:
    -

Abstract: Focusing on the query algorithm of XML data for path expressions and based on the marked suffix tree (MST), an optimizing algorithm is proposed for the common sub-queries in XML data for regular path expressions to improve the querying efficiency of path expressions through the redundancy eliminating technique. After a test done on the benchmark REOA, a performance analysis is made to the optimizing algorithm for the common sub-queries on MST basis. The result shows that the redundancy eliminating technique based on MST and used in XML data for path expressions will greatly improve the querying efficiency.

CLC Number: