Please use this identifier to cite or link to this item:
Title: Efficient mining of frequent XML query patterns with repeating-siblings
Authors: Yang, L.H.
Lee, M.L. 
Hsu, W. 
Huang, D.
Wong, L. 
Keywords: Frequent pattern mining
Structured pattern
Tree pattern mining
XML query pattern
Issue Date: 2008
Citation: Yang, L.H., Lee, M.L., Hsu, W., Huang, D., Wong, L. (2008). Efficient mining of frequent XML query patterns with repeating-siblings. Information and Software Technology 50 (5) : 375-389. ScholarBank@NUS Repository.
Abstract: A recent approach to improve the performance of XML query evaluation is to cache the query results of frequent query patterns. Unfortunately, discovering these frequent query patterns is an expensive operation. In this paper, we develop a two-pass mining algorithm 2PXMiner that guarantees the discovery of frequent query patterns by scanning the database at most twice. By exploiting a transaction summary data structure, and an enumeration tree, we are able to determine the upper bounds of the frequencies of the candidate patterns, and to quickly prune away the infrequent patterns. We also design an index to trace the repeating candidate subtrees generated by sibling repetition, thus avoiding redundant computations. Experiments results indicate that 2PXMiner is both efficient and scalable. © 2007 Elsevier B.V. All rights reserved.
Source Title: Information and Software Technology
ISSN: 09505849
DOI: 10.1016/j.infsof.2007.02.019
Appears in Collections:Staff Publications

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


checked on Mar 25, 2019


checked on Mar 6, 2019

Page view(s)

checked on Mar 3, 2019

Google ScholarTM



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