Name
Abstract | ||
|---|---|---|
This paper presents a novel and complementary technique to optimize an XPath query by mini- mizing its wildcard steps. Our approach is based on using a general composite axis called the layer axis, to rewrite a sequence of XPath steps (all of which are wildcard steps except for possibly the last) into a single layer-axis step. We de- scribe an efficient implementation of the layer axis and present a novel and efficient rewriting algo- rithm to minimize both non-branching as well as branching wildcard steps in XPath queries. We also demonstrate the usefulness of wildcard-step elimination by proposing an optimized evaluation strategy for wildcard-free XPath queries that en- ables selective loading of only the relevant input XML data for query evaluation. Our experimen- tal results not only validate the scalability and ef- ficiency of our optimized evaluation strategy, but also demonstrate the effectiveness of our rewrit- ing algorithm for minimizing wildcard steps in XPath queries. To the best of our knowledge, this is the first effort that addresses this new optimiza- tion problem. |
Year | Venue | Keywords |
|---|---|---|
2004 | VLDB | xpath step,optimized evaluation strategy,query evaluation,efficient implementation,wildcard-free xpath query,wildcard step,general composite axis,complementary technique,layer axis,xpath query |
Field | DocType | ISBN |
Evaluation strategy,Wildcard,Computer science,Xml data,Theoretical computer science,XPath,Rewriting,Optimization problem,Database,Branching (version control),Scalability | Conference | 0-12-088469-0 |
Citations | PageRank | References |
17 | 1.03 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chee Yong Chan | 1 | 643 | 199.24 |
| Wenfei Fan | 2 | 4154 | 197.29 |
| Yiming Zeng | 3 | 25 | 2.61 |