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

Dong Hong Han*, Guo Ren Wang, Bai You Qiao

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)535-537
Number of pages3
JournalDongbei Daxue Xuebao/Journal of Northeastern University
Volume26
Issue number6
Publication statusPublished - Jun 2005
Externally publishedYes

Keywords

  • Common sub-queries
  • Marked suffix tree (MST)
  • Query optimization
  • Redundancy eliminating technique
  • XML data regular path expressions

Fingerprint

Dive into the research topics of 'Optimizing common sub-queries in XML data for regular path expressions'. Together they form a unique fingerprint.

Cite this