Liang Huai Yang
ABSTRACT
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.
- T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, S. Arikawa. Efficient substructure discovery from large semistructured data. 2nd SIAM International Conference on Data Mining, 2002.Google Scholar
Cross Ref
- R. Agrawal and R. Srikant. Fast algorithms for mining association rules. VLDB, pp:487--499, 1994. Google ScholarDigital Library
- L. Chen, E. A. Rundensteiner, S. Wang. XCache-A Semantic Caching System for XML Queries. ACM SIGMOD, pp:618, 2002. Google ScholarDigital Library
- G. Miklau, D. Suciu. Containment and Equivalence of Tree Pattern Queries. ACM PODS, pp:65--76, 2002. Google ScholarDigital Library
- L.H. Yang, M.L. Lee, W. Hsu. Efficient Mining of XML Query Patterns for Caching. VLDB, pp:69--80, 2003. Google ScholarDigital Library
- L.H. Yang, M.L. Lee, W. Hsu, S. Acharya. Mining Frequent Query Patterns from XML Queries. DASFAA, pp:355--362, 2003. Google ScholarDigital Library
- M. Zaki. Efficiently Mining Frequent Trees in a Forest. ACM SIGKDD, pp:71--80, 2002. Google ScholarDigital Library
Index Terms
- 2PXMiner: an efficient two pass mining of frequent XML query patterns
Recommendations
Finding hot query patterns over an XQuery stream
Caching query results is one efficient approach to improving the performance of XML management systems. This entails the discovery of frequent XML queries issued by users. In this paper, we model user queries as a stream of XML query pattern trees and ...
Efficient mining of frequent XML query patterns with repeating-siblings
A recent approach to improve the performance of XML query evaluation is to cache the query results of frequent query patterns. Unfortunately, discovering these frequent query patterns is an expensive operation. In this paper, we develop a two-pass ...
Frequent pattern mining in attributed trees: algorithms and applications
Frequent pattern mining is an important data mining task with a broad range of applications. Initially focused on the discovery of frequent itemsets, studies were extended to mine structural forms like sequences, trees or graphs. In this paper, we ...
Comments