APEX: an adaptive path index for XML data
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
XCache: a semantic caching system for XML queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
2PXMiner: an efficient two pass mining of frequent XML query patterns
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
XML structural delta mining: issues and challenges
Data & Knowledge Engineering - Special issue: ER 2003
| Hi-index | 0.00 |
Existing XML query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees based on the number of occurrences of the query pattern trees in the history. Each occurrence of the same query pattern tree is considered equally important for the caching strategy. However, the same query pattern tree may occur at different timepoints in the history of XML queries. This temporal feature can be used to improve the caching strategy. In this paper, we propose a novel type of query pattern called conserved query paths for efficient caching by integrating the support and temporal features together. Conserved query paths are paths in query pattern trees that never change or do not change significantly most of the time (if not always) in terms of their support values during a specific time period. We proposed an algorithm to extract those conserved query paths. By ranking those conserved query paths, a dynamic-conscious caching (DCC) strategy is proposed for efficient XML query processing. Experiments show that the DCC caching strategy outperforms the existing XML query pattern tree-based caching strategies.