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
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Frequent Quer Patterns from XML Queries
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Mining conserved XML query paths for dynamic-conscious caching
Proceedings of the 14th ACM international conference on Information and knowledge management
Efficient mining of frequent XML query patterns with repeating-siblings
Information and Software Technology
Incremental sequence-based frequent query pattern mining from XML queries
Data Mining and Knowledge Discovery
On the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Data conceptualisation for web-based data-centred application design
CAiSE'06 Proceedings of the 18th international conference on Advanced Information Systems Engineering
Hi-index | 0.00 |
Caching the results of frequent query patterns can improve the performance of query evaluation. This paper describes a 2-pass mining algorithm called 2PXMiner to discover frequent XML query patterns. We design 3 data structures to expedite the mining process. Experiments results indicate that 2PXMiner is both efficient and scalable.