AD-LRU: An efficient buffer replacement algorithm for flash-based databases
AD-LRU: An efficient buffer replacement algorithm for flash-based databases
复制标题
AD-LRU：基于闪存的数据库的高效缓冲区替换算法
DOI：
10.1016/j.datak.2011.09.007
复制
发表时间：
2012-02-01
影响因子：
2.5
通讯作者：
Li, Zhi
中科院分区：
文献类型：
--
作者：
Jin, Peiquan;Ou, Yi;Li, Zhi
闪存存储器具有用于读取、写入和擦除操作的位置外更新和非对称I/O延迟的特性。因此，基于闪存的数据库的缓冲策略必须考虑这些属性，以提高整体性能。本文介绍了一种新的基于闪存的数据库缓冲区管理方法，称为AD-LRU（自适应双LRU）。其集中于通过减少写入/擦除操作的数量和通过保持高缓冲器命中率来提高总体运行时间效率。我们进行跟踪驱动的实验，在模拟环境中，并在一个真实的DBMS，使用一个真实的OLTP跟踪和四种合成跟踪：随机，最读，最写，和Zipf。我们的算法和最知名的竞争对手的方法之间进行了详细的比较。实验结果表明，AD-LRU在大多数情况下上级其竞争对手。(C)2011爱思唯尔有限公司版权所有。
Flash memory has characteristics of out-of-place update and asymmetric I/O latencies for read, write, and erase operations. Thus, the buffering policy for flash-based databases has to consider those properties to improve the overall performance. This article introduces a new approach to buffer management for flash-based databases, called AD-LRU (Adaptive Double LRU). which focuses on improving the overall runtime efficiency by reducing the number of write/erase operations and by retaining a high buffer hit ratio. We conduct trace-driven experiments both in a simulation environment and in a real DBMS, using a real OLTP trace and four kinds of synthetic traces: random, read-most, write-most, and Zipf. We make detailed comparisons between our algorithm and the best-known competitor methods. The experimental results show that AD-LRU is superior to its competitors in most cases. (C) 2011 Elsevier B.V. All rights reserved.