Enhanced dual Bloom filter based on SSD for efficient directory parsing in cloud storage system
暂无分享,去创建一个
[1] Garth A. Gibson,et al. Scale and Concurrency of GIGA+: File System Directories with Millions of Files , 2011, FAST.
[2] M. V. Ramakrishna,et al. A Performance Study of Hashing Functions for Hardware Applications , 1994 .
[3] GhemawatSanjay,et al. The Google file system , 2003 .
[4] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[5] Farzaneh Sadat Tabataba,et al. Improving false positive in Bloom filter , 2011, 2011 19th Iranian Conference on Electrical Engineering.
[6] Thomas E. Anderson,et al. A Comparison of File System Workloads , 2000, USENIX Annual Technical Conference, General Track.
[7] John W. Lockwood,et al. Deep packet inspection using parallel bloom filters , 2004, IEEE Micro.
[8] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[9] Nong Xiao,et al. An SSD-based accelerator for directory parsing in storage systems containing massive files , 2013, Peer Peer Netw. Appl..
[10] Jongmoo Choi,et al. VSSIM: Virtual machine based SSD simulator , 2013, 2013 IEEE 29th Symposium on Mass Storage Systems and Technologies (MSST).
[11] Li Fan,et al. Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.