基于MWM的闪存数据库缓冲区置换算法  

Buffer replacement algorithm for flash database systems based on MWM

作　　者：崔金华[1] 伍卫国[1] 王寅峰[2] 

机构地区：[1]西安交通大学电子与信息工程学院,陕西西安710049 [2]深圳信息职业技术学院软件学院,广东深圳518172

出　　处：《华中科技大学学报（自然科学版）》2015年第3期118-122,共5页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(91330117;61202041);国家高技术研究发展计划资助项目(2012AA01A306);深圳基础研究项目(JCYJ20120615101127404);深圳科技攻关项目(JSGG20140519141854753)

摘　　要：针对现有闪存数据库缓冲区置换算法无法充分发挥闪存存储器性能的现状,提出了一种基于最小权重矩阵(MWM)的高效缓冲区置换算法.该算法基于缓冲区代价置换算法思想,使用MWM来组织管理缓冲区的数据块,将数据访问频度映射为权重参数,用来参与缓冲区中数据块的置换.在闪存感知平台Flash-DBSim上针对几种典型测试类型数据集进行对比实验,结果表明:本文算法充分利用数据访问特征,特别适用于数据库中数据使用频率高的应用场景.A buffer replacement algorithm based on minimum weighted matrix(MWM)was proposed to facilitate the buffer replacement policies to enable flash-based database take advantages of flash materials.The cost-based least recently used(CBLRU)approach was drilled down and a more flashaware policy was offered,in which MWM managed both the data pages and the data access frequencies to evaluate the weight values.Furthermore the performance improvement was estimated by the standard simulation platform called Flash-DBSim.Experiments on trace data and comparisons with the classical flash buffer replacement algorithms demonstrate that this algorithm is more powerful and more flexible,in particular with respect to the scenario of ultra-high data access frequency in main memory database domain.

关 键 词：闪存固态硬盘 缓冲存储器 置换策略 闪存数据库 最小权重矩阵 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]