Don't thrash: How to cache your hash on flash

Proceedings of the VLDB Endowment

Volumn 5, Issue 11, 2012, Pages 1627-1637

  Bender, Michael A ^a,d   Farach Colton, Martin ^b,d   Johnson, Rob ^a   Kraner, Russell ^e   Kuszmaul, Bradley C ^c,d   Medjedovic, Dzejla ^a   Montes, Pablo ^a   Shetty, Pradeep ^a   Spillane, Richard P ^a   Zadok, Erez ^a  

^a STONY BROOK UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d Tokutek   (United States)

^e VCORE Solutions LLC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; DIGITAL STORAGE; RANDOM ACCESS STORAGE;

BASIC OPERATION; BLOOM FILTERS; COMPACT DATA STRUCTURE; DATA LOCALITY; IT SUPPORTS; MEMBERSHIP QUERY; SPACE AND TIME; STORAGE SYSTEMS;

DATA STRUCTURES;

EID: 84873108209     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2350229.2350275     Document Type: Article

References (22)

1. M. A. Bender, M. Farach-Colton, J. T. Fineman, Y. R. Fogel, B. C. Kuszmaul, and J. Nelson. Cache-oblivious streaming B-trees. In SPAA, pages 81-92, 2007.
2. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communincations of the ACM, 13(7):422-426, 1970.
3. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese. An improved construction for counting Bloom filters. In ECA, pages 684-695, 2006.
4. A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics, 1(4):485-509, 2003.
5. M. Canim, G. A. Mihaila, B. Bhattacharhee, C. A. Lang, and K. A. Ross. Buffered Bloom filters on solid state storage. In VLDB ADMS Workshop, 2010.
6. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber. Bigtable: A distributed storage system for structured data. In OSDI, pages 205-218, 2006.
7. Y. Chen, B. Schmidt, and D. L. Maskell. A reconfigurable Bloom filter architecture for BLASTN. In ARCS, pages 40-49, 2009.
8. H. Cheung. TG Video: Fusion io - the power of 1000 hard drives in the palm of your hand. http://www.tgdaily.com/hardware-features/34065-tg-video-fusion-io-the-power-of-1000-hard-drives-in-the-palm-of-your-hand, 2007.
9. J. G. Cleary. Compact hash tables using bidirectional linear probing. IEEE Transactions on Computing, 33(9):828-834, 1984.
10. B. Debnath, S. Sengupta, J. Li, D. Lilja, and D. Du. Bloomflash: Bloom filter on flash-based storage. In ICDCS, pages 635-644, 2011.
11. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking, 8(3):281-293, 2000.
12. L. Freeman. How NetApp deduplication works - a primer, Apr. 2010. http://blogs.netapp.com/drdedupe/2010/04/how-netapp-deduplication-works.html.
13. G. J. Holzmann. Design and validation of computer protocols. Prentice-Hall, Inc., 1991.
14. K. Keeton, C. B. Morrey, III, C. A. Soules, and A. Veitch. Lazybase: freshness vs. performance in information management. SIGOPS Operating Systems Review, 44(1):15-19, 2010.
15. D. E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison Wesley, 1973.
16. Z. Li, R. Grosu, P. Sehgal, S. A. Smolka, S. D. Stoller, and E. Zadok. On the energy consumption and performance of systems software. In SYSTOR, pages 8:1-8:12, 2011.
17. G. Lu, B. Debnath, and D. H. C. Du. A forest-structured bloom filter with flash memory. In MSST, pages 1-6, 2011.
18. K. Malde and B. O'Sullivan. Using Bloom filters for large scale gene sequence analysis in Haskell. In PADL, pages 183-194, 2009.
19. J. Mullin. Optimal semijoins for distributed database systems. IEEE Transactions on Software Engineering, 16(5):558 -560, 1990.
20. A. Singh, M. Srivatsa, L. Liu, and T. Miller. Apoidea: A decentralized peer-to-peer architecture for crawling the world wide web. In SIGIR Workshop on Distributed Multimedia Information Retrieval, pages 126-142, 2003.
21. Z. Yuan, J. Miao, Y. Jia, and L. Wang. Counting data stream based on improved counting Bloom filter. In WAIM, pages 512-519, 2008.
22. B. Zhu, K. Li, and H. Patterson. Avoiding the disk bottleneck in the data domain deduplication file system. In FAST, pages 18:1-18:14, 2008.