首页> 外文会议>International Conference on Computer Technology, Electronics and Communication >Page Weight-Based Buffer Replacement Algorithm for Flash-Based Databases
【24h】

Page Weight-Based Buffer Replacement Algorithm for Flash-Based Databases

机译:基于闪存的数据库的页面重量的缓冲替换算法

获取原文

摘要

With the development of flash memory technology and the increase of flash memory capacity, the flash memory storage is widely used, which brings opportunities and challenges to flash-based database management. The traditional buffer replacement algorithm for disk-oriented database fails to make full use of flash memory as a result of different read-write ways and read-write properties for flash memory and disk. This paper proposes the buffer replacement algorithm for flash-based database based on page weight called DPW-LRU. Based on the data page access frequency, the algorithm divides the buffer into hot list and cold list, and wherein, the former is used to store data pages accessed over two times, while the latter is used to store those accessed for once; at the same time, the dirty page is assigned weight to evict the low weight page preferentially. The experimental results show that the DPW-LRU algorithm is effective and feasible because it ensures hit ratio while reducing I/O access overhead.
机译:随着闪存技术的发展和闪存容量的增加,闪存存储的广泛使用,为基于闪存的数据库管理带来了机会和挑战。由于闪存和磁盘和磁盘的不同读写方式,传统的缓冲区数据库的缓冲区替换算法无法充分利用闪存和闪存和磁盘的读写属性。本文提出了基于Page权重的基于闪存的数据库的缓冲替换算法,称为DPW-LRU。基于数据页访问频率,算法将缓冲区划分为热门列表和冷列表,并且其中,前者用于存储多次访问的数据页面,而后者用于存储一次访问的数据页面。同时,脏页被分配权重,以优先释放低权重页面。实验结果表明,DPW-LRU算法有效可行,因为它确保了命中率,同时减少I / O访问开销。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号