The Community for Technology Leaders
Sixth International Conference on Data Mining (ICDM'06) (2006)
Hong Kong
Dec. 18, 2006 to Dec. 22, 2006
ISSN: 1550-4786
ISBN: 0-7695-2701-9
pp: 350-361
Guoliang Li , Tsinghua University, China
Jianhua Feng , Tsinghua University, China
Jianyong Wang , Tsinghua University, China
Yong Zhang , Tsinghua University, China
Lizhu Zhou , Tsinghua University, China
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns from scratch periodically by checking the entire transaction database, which consists of XML query patterns transformed from user queries. However, it is nontrivial to maintain such discovered frequent patterns in real XML databases because there may incur frequent updates that may not only invalidate some existing frequent query patterns but also generate some new frequent ones. Accordingly, existing proposals are inefficient for the evolution of the transaction database. <p>To address these problems, this paper presents an efficient algorithm IPS-FXQPMiner for mining frequent XML query patterns without candidate maintenance and costly tree-containment checking. We transform XML queries into sequences through a oneto- one mapping and then mine the frequent sequences to generate frequent XML query patterns. More importantly, based on IPS-FXQPMiner, an efficient incremental algorithm, Incre-FXQPMiner is proposed to incrementally mine frequent XML query patterns, which can minimize the I/O and computation requirements for handling incremental updates. Our experimental study on various real-life datasets demonstrates the efficiency and scalability of our algorithms over previous known alternatives.</p>

J. Feng, Y. Zhang, L. Zhou, J. Wang and G. Li, "Incremental Mining of Frequent Query Patterns from XML Queries for Caching," Sixth International Conference on Data Mining (ICDM'06)(ICDM), Hong Kong, 2006, pp. 350-361.
100 ms
(Ver 3.3 (11022016))