fpga -Grow:一种应用级IO模式挖掘的基于图的模式增长算法

Jingliang Zhang, Junwei Zhang, Lu Xu
{"title":"fpga -Grow:一种应用级IO模式挖掘的基于图的模式增长算法","authors":"Jingliang Zhang, Junwei Zhang, Lu Xu","doi":"10.1109/NAS.2010.23","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":284549,"journal":{"name":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"FPG-Grow: A Graph Based Pattern Grow Algorithm for Application Level IO Pattern Mining\",\"authors\":\"Jingliang Zhang, Junwei Zhang, Lu Xu\",\"doi\":\"10.1109/NAS.2010.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":284549,\"journal\":{\"name\":\"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAS.2010.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2010.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

以前对存储系统中模式发现的研究主要集中在较低级行的顺序模式(SP)挖掘,但它们不能很好地扩展到应用程序级别。由于应用层模式多由连续项目序列模式(CISP)组成,CISP比连续项目序列模式简单得多,使用笨拙的连续项目序列模式挖掘算法对CISP进行挖掘是低效的。我们提出了一种新的算法fpga - grow,它更适合于应用级IO模式的挖掘。fpga - grow算法只需要对原始序列进行一次扫描就能构造出频繁模式图(FPG),通过线性代价提取频繁子图就能很容易地提取出cisp。同时,通过避免原始序列扫描,可以有效地进行验证。此外,生长方法消除了序列切割带来的信息损失。实验结果表明,fpga - grow在真实应用IO轨迹的挖掘中明显优于C-Miner,仿真结果也证明了CISP在应用IO优化中的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
FPG-Grow: A Graph Based Pattern Grow Algorithm for Application Level IO Pattern Mining
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信