BUXMiner: an efficient bottom-up approach to mining XML query patterns

Authors:
Yijun Bei;Gang Chen;Jinxiang Dong
Affiliations:
College of Computer Science, Zhejiang University, Hangzhou, P.R. China;College of Computer Science, Zhejiang University, Hangzhou, P.R. China;College of Computer Science, Zhejiang University, Hangzhou, P.R. China
Venue:
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Year:
2007

Citing 8
Cited 1

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
Mining Frequent Quer Patterns from XML Queries

DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Indexing and Mining Free Trees

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
HybridTreeMiner: An Efficient Algorithm for Mining Frequent Rooted Trees and Free Trees Using Canonical Forms

SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
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

Bottom-up discovery of frequent rooted unordered subtrees

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discovery of frequent XML query patterns in the history log of XML queries can be used to expedite XML query processing, as the answers to these queries can be cached and reused when the future queries "hit" such frequent patterns. In this paper, we propose an efficient bottom-up mining approach to finding frequent query patterns in XML queries. We merge all queries into a summarizing structure named global tree guide (GTG). We refine GTG by pruning infrequent nodes and clustering adjacent nodes in the queries to obtain a Compressed GTG (known as CGTG). We employ a bottom-up traversal scheme based on CGTG to generate frequent query patterns for each node till the root of CGTG. Experiments show that our proposed method is efficient and outperforms the previous mining algorithms of XML queries, such as XQPMinerTID and FastXMiner.