Memory –efficient Data Management Policy for Flash-based Key-Value Store. Wang Jiangtao 2013-4-12. Outline. Introduction Related work Two works BloomStore [MSST2012] TBF[ICDE2013] Summary. Key-Value Store. KV store efficiently supports simple operations: Key lookup & KV pair insertion
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Memory –efficient Data Management Policy for Flash-based Key-Value Store
– often implemented through an index structure, mapping Key-> Value
32 B( Data deduplication) => 125 GB!
168 B(Tweet) => 24 GB
1 KB(Small image) => 4 GB
Per Key-value pair size (bytes)
Bloom filters in parallel
Key-Value cache prototype architecture