东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2005, Vol. 26 ›› Issue (6): 535-537.DOI: -

• 论著 • 上一篇    下一篇

XML路径表达式中公共子查询的优化技术

韩东红;王国仁;乔百友   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳　110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2005-06-15 发布日期:2013-06-24
  • 通讯作者: Han, D.-H.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60273039)

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:
    -

RichHTML

1

PDF (PC)

549

摘要： 研究了XML路径表达式的相关查询算法,提出了基于标注后缀树的XML路径表达式公共子查询的优化算法,通过冗余消除技术来提高路径表达式的查询效率·在REOA测试集上,通过对设计的查询进行测试,分析了基于标注后缀树的XML路径表达式公共子查询的优化算法的性能·实验结果表明,基于标注后缀树的XML路径表达式冗余消除技术可以极大地提高路径表达式的查询效率·

关键词: XML路径表达式, 公共子查询, 查询优化, 标注后缀树, 冗余消除技术

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.

中图分类号: