By Topic

FPG-Grow: A Graph Based Pattern Grow Algorithm for Application Level IO Pattern Mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhang Jing-Liang ; Inst. of Comput. Technol., Chinese Acad. of Sci., Beijing, China ; Zhang Jun-wei ; Xu Lu

The previous study of pattern discovery in storage systems focus on sequential pattern (SP) mining in lower level traces, but they don't scale well to the application level. For patterns in application level are mostly composed of Contiguous Item Sequential Patterns (CISP) which are much simpler than SP, so it's inefficient for the previous studies to mine CISP with clumsy SP mining algorithms. We propose a novel algorithm FPG-Grow which is more preferable for mining application level IO patterns. The FPG-Grow only scan the origin sequence in one-pass to construct a Frequent Pattern Graph (FPG), from which we can easily extract the CISPs by fetching the frequent sub-graphs with linear cost. Also we can do the verification efficiently by avoiding the origin sequence scan. Furthermore, the grow method will eliminate the information loss introduced by sequence cutting as C-Miner does. The experiment result shows that the FPG-Grow outperforms C-Miner prominently in mining with real application IO traces and the simulation result also proves the effectiveness of CISP in application IO optimizations.

Published in:

Networking, Architecture and Storage (NAS), 2010 IEEE Fifth International Conference on

Date of Conference:

15-17 July 2010