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 language | English |
|---|---|
| Pages (from-to) | 535-537 |
| Number of pages | 3 |
| Journal | Dongbei Daxue Xuebao/Journal of Northeastern University |
| Volume | 26 |
| Issue number | 6 |
| Publication status | Published - Jun 2005 |
| Externally published | Yes |
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver