期刊文献+

一种面向闪存键值存储的矩阵索引布鲁姆过滤器

A Matrix-Indexed Bloom Filter for Flash-Based Key-Value Store
下载PDF
导出
摘要 索引结构是提高闪存键值存储插入和查询性能的关键技术之一.在分析目前相关索引结构特点的基础上提出了一种面向闪存键值存储的矩阵索引布鲁姆过滤器(matrix-indexed Bloom filter,MIBF),由m×s的位矩阵表示的多个布鲁姆过滤器组(multiple Bloom filter group,MBFG)和一个附加布鲁姆过滤器(additional Bloom filter,ABF)组成,其核心思想是键值对的闪存页地址被拆分为多组位串,每组位串采用MBFG中的一组布鲁姆过滤器(Bloom filter,BF)来表示,同时将键值对的Key与闪存页地址组合值存入ABF中.根据Key查询Value时,MBFG中的每组BF产生多位,组合生成键值对的闪存页地址,并通过ABF滤掉部分伪闪存页地址达到较精确地址定位,从而降低闪存访问次数,提高系统性能.与已有类似方法相比,MIBF的查询地址定位精度提高,内存和闪存访问次数降低明显,插入和查询性能显著提升. Flash-based key-value store, an important type of NoSQL database, has been widely used to store and query data. Indexing structure is an effective organization of data in the store system, which is one of the key technologies to improve the performance of system insertion and query. On the analysis of the characteristics and shortcomings of current and relevant indexing structure, matrix-indexed Bloom filter (MIBF) for flash-based key-value store is proposed. MIBF is composed of multiple Bloom filter group (MBFG) represented by m×s bits matrix and additional Bloom filter (ABF). The core idea of MIBF is that flash page address of key-value pair is split into multiple bit groups, and MBFG is also divided into multiple groups correspondingly, and each group bits are represented by one group Bloom filter (BF) in MBFG, while the combined value of key and flash page address is inserted into ABF. When an element is queried according to the key, each BF group in MBFG generates a plurality of bit values and combines to generate the flash page address for the key-value pairs. In order to reduce pseudo flash page address generated by the MBFG due to false positive probability, pseudo flash page addresses are filtered out through the ABF, thereby achieving more accurate address location, reducing the number of flash access, and improving the system performance. Compared with previous work, the address location accuracy of MIBF query is improved and the access number of RAM and flash is decreased significantly, which greatly improves the performance of solid state disk (SSD) insertion and query.
出处 《计算机研究与发展》 EI CSCD 北大核心 2015年第5期1210-1222,共13页 Journal of Computer Research and Development
基金 国家"九七三"重点基础研究发展计划基金项目(2012CB315805) 国家自然科学基金项目(61173167 61173168)
关键词 键值存储 闪存页地址 索引结构 布鲁姆过滤器 矩阵索引布鲁姆过滤器 key-value store flash page address indexing structure Bloom filter (BF) matrix-indexed Bloom filter (MIBF)
  • 相关文献

参考文献34

  • 1申德荣,于戈,王习特,聂铁铮,寇月.支持大数据管理的NoSQL系统研究综述[J].软件学报,2013,24(8):1786-1803. 被引量:193
  • 2Zhu B, Li K, Hugo P. Avoiding the disk bottleneck in the data domain deduplication file system [C] //Proc of the 6th USENIX Conf on File and Storage Technologies. Berkeley, CA: USENIX Association, 2008:1-14.
  • 3Lakshman A, Malik P. Cassandra.. A decentralized structured storage system [J]. Operating Systems Review, 2010, 44(2): 35-40.
  • 4Lim H, Fan B, Andersen D G, et al. SILT: A memory efficient, high-performance key-value Store [C] //Proc of the 23rd ACM Symp on Operating Systems Principles. New York: ACM, 2011:1-13.
  • 5王江涛,赖文豫,孟小峰.闪存数据库:现状、技术与展望[J].计算机学报,2013,36(8):1549-1567. 被引量:26
  • 6陆游游,舒继武.闪存存储系统综述[J].计算机研究与发展,2013,50(1):49-59. 被引量:54
  • 7Milo Polte, Jiri Simsa, Garth Gibson. Comparing performance of solid state devices and mechanical disks [C]// Proc of the 3rd Petascale Data Storage Workshop Held in Conjunction with Supercomputing. Pittsburgh: Petaseale Data Storage Institute, 2008: 1-7.
  • 8梁智超,周大,孟小峰.Sub-Join:面向闪存数据库的查询优化算法[J].计算机科学与探索,2010,4(5):401-409. 被引量:9
  • 9吕雁飞,陈学轩,崔斌.基于闪存的数据库性能评测与优化分析[J].计算机研究与发展,2009,46(增刊):307-312.
  • 10Hu Yang, Jiang Hong, Feng Dan, et al. Performance impact and interplay of SSD parallelism through advanced commands, allocation strategy and data granularity [C] // Proc of the 25th Int Conf on Supercomputing. New York: ACM, 2011:96-107.

二级参考文献234

  • 1顾宝根,顾喜梅.日志结构的嵌入式文件系统研究[J].计算机工程与设计,2004,25(6):915-917. 被引量:17
  • 2Lai S.Flash memories:Successes and challenges[J].IBM Journal of Research and Development,2008,52(4/5):529-535.
  • 3Chang Lipin,Kuo Teiwei.Efficient management for large-scale flash-memory storage systems with resource conservation[J].ACM Trans on Storage,2005,1(4):381-418.
  • 4Park C,Seo J,Bae S,et al.A low-cost memory architecture with NAND XIP for mobile embedded systems[C]//Proc of the 1st IEEE/ACM/IFIP Int Conf on Hardware-Software Codesign and System Synthesis.New York:ACM,2003:138-143.
  • 5Wu M,Willy Z.eNVy:A non-volatile main memory storage system[C]//Proc of the 6th Int Conf on Architectural Support for Programming Languages and Operating Systems.New York:ACM,1994:86-97.
  • 6Taeho K,Trevor M.FlashCache:A NAND flash memory file cache for low power Web servers[C]//Proc of the 2006 Int Conf on Compilers,Architecture and Synthesis for Embedded Systems.New York:ACM,2006:103-112.
  • 7Kgil T,Roberts D,Mudge T.Improving NAND flash based disk caches[C]//Proc of the 35th Int Symp on Computer Architecture.New York:ACM,2008:327-338.
  • 8Dushyanth N,Eno T,Austin D.Migrating server storage to SSDs:Analysis of tradeoffs[C]//Proc of the 4th ACM European Conf on Computer Systems.New York:ACM,2009:145-158.
  • 9Microsoft Corp.Explore the features:Performance[EB/OL].[2008-12-05].http://www.microsoft.com/windows/windows-vista/features/performance.aspx.
  • 10Shmidt D.Trueffs wear-leveling mechanism[R].Newark,CA:M-System,2002.

共引文献352

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部