作者
Guanlin Lu, Biplob Debnath, David HC Du
发表日期
2011/5/23
研讨会论文
2011 IEEE 27th Symposium on Mass Storage Systems and Technologies (MSST)
页码范围
1-6
出版商
IEEE
简介
A Bloom Filter (BF) is a data structure based on probability to compactly represent/record a set of elements (keys). It has wide applications on efficiently identifying a key that has been seen before with minimum amount of recording space used. BF is heavily used in chunking based data de-duplication. Traditionally, a BF is implemented as in-RAM data structure; hence its size is limited by the available RAM space on the machine. For certain applications like data de-duplication that require a big BF beyond the size of available RAM space, it becomes necessary to store a BF into a secondary storage device. Since BF operations are inherently random in nature, magnetic disk provides worse performance for the random read and write operations. It will not be a good fit for storing the large BF. Flash memory based Solid State Drive (SSD) has been considered as an emerging storage device that has superior …
引用总数
201120122013201420152016201720182019202020212022202320243114232478513221
学术搜索中的文章
G Lu, B Debnath, DHC Du - 2011 IEEE 27th Symposium on Mass Storage Systems …, 2011