Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient algorithms for minimizing tree pattern queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Structural Properties of XPath Fragments
ICDT '03 Proceedings of the 9th International Conference on Database Theory
WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
ViST: a dynamic index method for querying XML data by tree structures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
PRIX: Indexing And Querying XML Using Prüfer Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Secure XML querying with security views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Filtering unsatisfiable XPath queries
Data & Knowledge Engineering
On the minimization of XPath queries
Journal of the ACM (JACM)
Data & Knowledge Engineering
A utilization of schema constraints to transform predicates in XPath query
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
Semantic transformation approach with schema constraints for XPath query axes
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Efficient schemes of executing star operators in XPath query expressions
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
This paper presents a novel and complementary technique to optimize an XPath query by minimizing 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 describe an efficient implementation of the layer axis and present a novel and efficient rewriting algorithm 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 enables selective loading of only the relevant input XML data for query evaluation. Our experimental results not only validate the scalability and efficiency of our optimized evaluation strategy, but also demonstrate the effectiveness of our rewriting algorithm for minimizing wildcard steps in XPath queries. To the best of our knowledge, this is the first effort that addresses this new optimization problem.