Please use this identifier to cite or link to this item:
Title: Finding hot query patterns over an XQuery stream
Authors: Yang, L.H. 
Lee, M.L. 
Hsu, W. 
Keywords: Frequent pattern mining
Pattern tree
Stream mining
Tree mining
XML query pattern
Issue Date: 2004
Citation: Yang, L.H., Lee, M.L., Hsu, W. (2004). Finding hot query patterns over an XQuery stream. VLDB Journal 13 (4) : 318-332. ScholarBank@NUS Repository.
Abstract: 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.
Source Title: VLDB Journal
ISSN: 10668888
DOI: 10.1007/s00778-004-0134-4
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Apr 14, 2019


checked on Mar 27, 2019

Page view(s)

checked on Mar 24, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.