BUXMiner: An Efficient Bottom-Up Approach to Mining XML Query Patterns

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.