An FPGA implementation of high-throughput key-value store using Bloom filter
暂无分享,去创建一个
[1] Andrei Broder,et al. Network Applications of Bloom Filters: A Survey , 2004, Internet Math..
[2] Eitan Frachtenberg,et al. Many-core key-value store , 2011, 2011 International Green Computing Conference and Workshops.
[3] David Hutchison,et al. Scalable Bloom Filters , 2007, Inf. Process. Lett..
[4] Jin Li,et al. FlashStore: High Throughput Persistent Key-Value Store , 2010, Proc. VLDB Endow..
[5] Amin Vahdat,et al. Efficient Peer-to-Peer Keyword Searching , 2003, Middleware.
[6] Guy M. Lohman,et al. Optimizer Validation and Performance Evaluation for Distributed Queries , 1998 .
[7] Bernard Chazelle,et al. The Bloomier filter: an efficient data structure for static support lookup tables , 2004, SODA '04.
[8] Li Fan,et al. Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.
[9] David Hung-Chang Du,et al. BloomStore: Bloom-Filter based memory-efficient key-value store for indexing of data deduplication on flash , 2012, 012 IEEE 28th Symposium on Mass Storage Systems and Technologies (MSST).
[10] Rasmus Pagh,et al. Cuckoo Hashing , 2001, Encyclopedia of Algorithms.
[11] Martin Margala,et al. An FPGA memcached appliance , 2013, FPGA '13.