XCache: a semantic caching system for XML queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Mining positive and negative association rules from XML query patterns for caching
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
| Hi-index | 0.00 |
Querying on XML data is a computational-expensive process due to the complex nature of both the XML data and the query. In this paper, we propose an approach to expedite XML query processing by caching the results of a specific class of queries, namely the maximal frequent queries. We mine the maximal frequent query patterns from user-issued queries and cache the results of such queries. We propose a recursive algorithm for query processing using the cached query results. Query rewriting is employed to deal with four kinds of similar queries namely exact matching, exact containment, semantic matching and semantic containment. We perform experiments on the XMARK datasets and show that the proposed methods are both effective and efficient in improving the performance of XML queries.