Finding hot query patterns over an XQuery stream

• Published in: The VLDB journal Vol. 13; no. 4; pp. 318 - 332
• Main Authors: Yang, Liang Huai, Lee, Mong Li, Hsu, Wynne
• Format: Journal Article
• Language: English
• Published: 01.12.2004
• ISSN: 1066-8888; 0949-877X
• DOI: 10.1007/s00778-004-0134-4

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 mine the frequent query patterns over the query stream. To facilitate the one-pass mining process, we devise a novel data structure called DTS to summarize the pattern trees seen so far. By grouping the incoming pattern trees into batches, we can dynamically mark the active portion of the current batch in DTS and limit the enumeration of candidate trees to only the currently active pattern trees. We also design another summary data structure called ECTree that provides for the incremental computation of the frequent tree patterns over the query stream. Based on the above two constructs, we present two mining algorithms called XQSMinerI and XQSMinerII. XQSMinerI is fast, but it tends to overestimate, while XQSMinerII adopts a filter-and-refine approach to minimize the amount of overestimation. Experimental results show that the proposed methods are both efficient and scalable and require only small memory footprints.