메뉴 건너뛰기




Volumn , Issue , 2012, Pages

BloomStore: Bloom-filter based memory-efficient key-value store for indexing of data deduplication on flash

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERS; DEDUPLICATION; FACEBOOK; INDEX DATA STRUCTURES; INDEX STRUCTURE; INTERNET SERVICES; LOOKUP PERFORMANCE; LOOKUPS; MULTI-PLAYER GAMING; RELATIONAL DATABASE; SECONDARY STORAGE; SPACE LIMITATIONS; STORAGE LOCATION; UNIQUE FEATURES;

EID: 84866181191     PISSN: 21601968     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MSST.2012.6232390     Document Type: Conference Paper
Times cited : (72)

References (21)
  • 2
    • 77955933052 scopus 로고    scopus 로고
    • Cassandra: A decentralized structured storage system
    • A. Lakshman and P. Malik, "Cassandra: a decentralized structured storage system," Operating Systems Review, vol. 44, no. 2, pp. 35-40, 2010.
    • (2010) Operating Systems Review , vol.44 , Issue.2 , pp. 35-40
    • Lakshman, A.1    Malik, P.2
  • 6
    • 85021210434 scopus 로고    scopus 로고
    • An efficient b-tree layer implementation for flash-memory storage systems
    • C.-H. Wu, T.-W. Kuo, and L.-P. Chang, "An efficient b-tree layer implementation for flash-memory storage systems," ACM Trans. Embedded Comput. Syst., vol. 6, no. 3, 2007.
    • (2007) ACM Trans. Embedded Comput. Syst. , vol.6 , Issue.3
    • Wu, C.-H.1    Kuo, T.-W.2    Chang, L.-P.3
  • 7
    • 35348838502 scopus 로고    scopus 로고
    • FlashDB: Dynamic self-tuning database for nand flash
    • T. F. Abdelzaher, L. J. Guibas, and M. Welsh, Eds. ACM
    • S. Nath and A. Kansal, "FlashDB: dynamic self-tuning database for nand flash," in IPSN, T. F. Abdelzaher, L. J. Guibas, and M. Welsh, Eds. ACM, 2007, pp. 410-419.
    • (2007) IPSN , pp. 410-419
    • Nath, S.1    Kansal, A.2
  • 9
    • 85076745795 scopus 로고    scopus 로고
    • Cheap and large cams for high performance data-intensive networked systems
    • USENIX Association
    • A. Anand, C. Muthukrishnan, S. Kappes, A. Akella, and S. Nath, "Cheap and large cams for high performance data-intensive networked systems," in NSDI. USENIX Association, 2010, pp. 433-448.
    • (2010) NSDI , pp. 433-448
    • Anand, A.1    Muthukrishnan, C.2    Kappes, S.3    Akella, A.4    Nath, S.5
  • 10
    • 79959924575 scopus 로고    scopus 로고
    • SkimpyStash: RAM space skimpy key-value store on flash-based storage
    • T. K. Sellis, R. J. Miller, A. Kementsietsidis, and Y. Velegrakis, Eds. [Online]. Available
    • B. Debnath, S. Sengupta, and J. Li, "SkimpyStash: RAM space skimpy key-value store on flash-based storage," in SIGMOD Conference, T. K. Sellis, R. J. Miller, A. Kementsietsidis, and Y. Velegrakis, Eds. ACM, 2011, pp. 25-36. [Online]. Available: http://doi.acm.org/10.1145/1989323.1989327
    • (2011) SIGMOD Conference , pp. 25-36
    • Debnath, B.1    Sengupta, S.2    Li, J.3
  • 11
    • 82655175533 scopus 로고    scopus 로고
    • SILT: A memory-efficient, high-performance key-value store
    • T. Wobber and P. Druschel, Eds. ACM
    • H. Lim, B. Fan, D. G. Andersen, and M. Kaminsky, "SILT: a memory-efficient, high-performance key-value store," in SOSP, T. Wobber and P. Druschel, Eds. ACM, 2011, pp. 1-13.
    • (2011) SOSP , pp. 1-13
    • Lim, H.1    Fan, B.2    Andersen, D.G.3    Kaminsky, M.4
  • 12
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • July [Online]. Available
    • B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commun. ACM, vol. 13, pp. 422-426, July 1970. [Online]. Available: http://doi.acm.org/10.1145/362686.362692
    • (1970) Commun. ACM , vol.13 , pp. 422-426
    • Bloom, B.H.1
  • 14
    • 70849094136 scopus 로고    scopus 로고
    • FlashLogging: Exploiting flash devices for synchronous logging performance
    • [Online]. Available
    • S. Chen, "FlashLogging: exploiting flash devices for synchronous logging performance," in SIGMOD Conference. ACM, 2009, pp. 73-86. [Online]. Available: http://doi.acm.org/10.1145/1559845.1559855
    • (2009) SIGMOD Conference , pp. 73-86
    • Chen, S.1
  • 16
    • 36949037456 scopus 로고    scopus 로고
    • Segmented Hash: An efficient hash table implementation for high performance networking subsystems
    • A. D. Berenbaum, K. Li, and J. S. Turner, Eds. [Online]. Available
    • S. Kumar and P. Crowley, "Segmented Hash: an efficient hash table implementation for high performance networking subsystems," in ANCS, A. D. Berenbaum, K. Li, and J. S. Turner, Eds. ACM, 2005, pp. 91-103. [Online]. Available: http://doi.acm.org/10.1145/1095890.1095904
    • (2005) ANCS , pp. 91-103
    • Kumar, S.1    Crowley, P.2
  • 17
    • 84883295790 scopus 로고
    • The design and implementation of a log-structured file system
    • Oct.
    • M. Rosenblum and J. Ousterhout, "The design and implementation of a log-structured file system," in sosp, Oct. 1991, pp. 1-15.
    • (1991) Sosp , pp. 1-15
    • Rosenblum, M.1    Ousterhout, J.2
  • 18
    • 80051872816 scopus 로고    scopus 로고
    • BloomFlash: Bloom filter on flash-based storage
    • Proceedings of the 31th International Conference on Distributed Computing Systems, ser.
    • B. Debnath, S. Sengupta, J. Li, D. J. Lilja, and D. H. Du, "BloomFlash: Bloom filter on flash-based storage," in Proceedings of the 31th International Conference on Distributed Computing Systems, ser. ICDCS 2011, 2011.
    • (2011) ICDCS 2011
    • Debnath, B.1    Sengupta, S.2    Li, J.3    Lilja, D.J.4    Du, D.H.5
  • 20
    • 85077032135 scopus 로고    scopus 로고
    • A study of practical deduplication
    • G. R. Ganger and J. Wilkes, Eds. USENIX
    • D. T. Meyer and W. J. Bolosky, "A study of practical deduplication," in FAST, G. R. Ganger and J. Wilkes, Eds. USENIX, 2011, pp. 1-13.
    • (2011) FAST , pp. 1-13
    • Meyer, D.T.1    Bolosky, W.J.2
  • 21
    • 79960029416 scopus 로고    scopus 로고
    • FlashStore: High Throughput Persistent Key-Value Store
    • B. Debnath, S. Sengupta, and J. Li, "FlashStore: High Throughput Persistent Key-Value Store," in VLDB, 2010.
    • (2010) VLDB
    • Debnath, B.1    Sengupta, S.2    Li, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.