Rewriting of regular expressions and regular path queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Generating efficient plans for queries using views
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XCache: a semantic caching system for XML queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Semantic caching of Web queries
The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Query caching and view selection for XML databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Rewriting nested XML queries using nested views
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Answering tree pattern queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Answering xpath queries over networks by sending minimal views
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A framework for using materialized XPath views in XML query processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Structured materialized views for XML queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Multiple Materialized View Selection for XPath Query Rewriting
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Answering XML queries using materialized views revisited
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient rewriting of XPath queries using Query Set Specifications
Proceedings of the VLDB Endowment
MQTree based query rewriting over multiple XML views
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Answering tree pattern queries using views: a revisit
Proceedings of the 14th International Conference on Extending Database Technology
Evaluating contained rewritings for XPath queries on materialized views
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
A Performance Analysis of Semantic Caching for XML Query Processing
International Journal of Knowledge-Based Organizations
Hi-index | 0.00 |
The query rewriting plan generation over XML views has received wide attention recently. However, little work has been done on efficient evaluation of the query rewriting plans, which is not trivial since the plan may contain an exponential size of sub-plans. This paper investigates the reason for the potentially exponential number of sub-plans, and then proposes a new space-efficient form called ABCPlan (Plan with Automata Based Combinations) to equivalently represent the original query rewriting plan. ABCPlan contains a set of buckets containing suffix paths in the query tree and an automata to indicate the combination of the suffix paths from different buckets as valid query rewriting sub-plans. We also design an evaluation method called ABCScan, which constructs a unified evaluation tree for the ABCPlan and handles the evaluation tree in one scan of the XML view. In the evaluation, we introduce node existence automata to encode the structure of the sub-tree and convert the satisfaction of the ABCPlan into the intersection problem of deterministic finite automata. The experiments show that ABCPlan based method outperforms existing methods significantly in terms of scalability and efficiency.