A forest-structured Bloom Filter with flash memory

2011 IEEE 7th International Workshop on Storage Network Architecture and Parallel I/Os, SNAPI 2011

Volumn , Issue , 2011, Pages

  Lu, Guanlin ^a   Debnath, Biplob ^b   Du, David H C ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

^b Root cause Analysis Network Management Design and Development   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDPASS FILTERS; DATA STRUCTURES; FORESTRY; MEMORY ARCHITECTURE; NETWORK ARCHITECTURE; PARALLEL ARCHITECTURES; RANDOM ACCESS STORAGE; VIRTUAL STORAGE;

DATA DE DUPLICATIONS; LOOKUP PERFORMANCE; PHYSICAL CHARACTERISTICS; PROCESSING SPEED; SECONDARY STORAGE; SOLID STATE DRIVES (SSD); STRUCTURE-BASED; WRITE OPERATIONS;

FLASH MEMORY;

EID: 85053754528     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Ocz agility sata 2.5 ssd: http://www.ocztechnology.com.
2. ioxtreme user guide for linux, version 3 for driver release 1.2.7. page 8, 12 2009.
3. Paulo Sergio Almeida, Carlos Baquero, Nuno Preguica, and David Hutchison. Scalable bloom filters. Information Processing Letters, 101(6), 2007.
4. Burton H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13:422-426, July 1970.
5. Mustafa Canim, George A. Mihalia, Bishwaranjan Bhattacharjee, Christian A. Lang, and Kenneth A. Ross. Buffered bloom filters on solid state storage. 2010.
6. Francisco M. Cuenca-Acuna, Christopher Peery, Richard P. Martin, and Thu D. Nguyen. PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities. In IEEE International Symposium on High Performance Distributed Computing (HPDC), 2003.
7. Biplob Debnath, Sudipta Sengupta, Jin Li, David J. Lilja, and David H.C. Du. Bloomflash: Bloom filter on flash-based storage. In Proceedings of the 31th International Conference on Distributed Computing Systems, ICDCS 2011, 2011.
8. D. Eastlake, 3rd and P. Jones. Us secure hash algorithm 1 (sha1), 2001.
9. Deke Guo, Honghui Chen, and Xueshan Luo. Theory and network applications of dynamic bloom filters. In In Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2006.
10. Navendu Jain, Mike Dahlin, and Renu Tewari. Taper: Tiered approach for eliminating redundancy in replica synchronization. In Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4, pages 21-21, Berkeley, CA, USA, 2005. USENIX Association.
11. John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Chris Wells, and Ben Zhao. Oceanstore: An architecture for global-scale persistent storage. SIGOPS Oper. Syst. Rev., 34:190-201, November 2000.
12. Guanlin Lu, Yu Jin, and David H. C. Du. Frequency based chunking for data de-duplication. In Proceedings of the 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS'10, pages 287-296, Washington, DC, USA, 2010. IEEE Computer Society.
13. Athicha Muthitacharoen, Benjie Chen, and David Mazières. A lowbandwidth network file system. In Proceedings of the eighteenth ACM symposium on Operating systems principles, SOSP'01, pages 174-187, New York, NY, USA, 2001. ACM.
14. Wei Wang, Haifeng Jiang, Hongjun Lu, and Jeffrey Xu Yu. Bloom histogram: path selectivity estimation for xml data with updates. In Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, VLDB'04, pages 240-251. VLDB Endowment, 2004.
15. Benjamin Zhu, Kai Li, and Patterson Hugo. Avoiding the disk bottleneck in the data domain deduplication file system. In In Proceedings of the 6th USENIX Conference on File and Storage Technologies, Berkeley, CA, USA, 2008. USENIX Association.