{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:35:43Z","timestamp":1783035343953,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,4,23]],"date-time":"2017-04-23T00:00:00Z","timestamp":1492905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["166306"],"award-info":[{"award-number":["166306"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["339539"],"award-info":[{"award-number":["339539"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,23]]},"DOI":"10.1145\/3064176.3064193","type":"proceedings-article","created":{"date-parts":[[2017,4,17]],"date-time":"2017-04-17T12:27:04Z","timestamp":1492432024000},"page":"80-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["FloDB"],"prefix":"10.1145","author":[{"given":"Oana","family":"Balmau","sequence":"first","affiliation":[{"name":"EPFL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[{"name":"EPFL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vasileios","family":"Trigonakis","sequence":"additional","affiliation":[{"name":"Oracle Labs"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Igor","family":"Zablotchi","sequence":"additional","affiliation":[{"name":"EPFL"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,4,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache Cassandra. http:\/\/cassandra.apache.org.  Apache Cassandra. http:\/\/cassandra.apache.org."},{"key":"e_1_3_2_1_2_1","unstructured":"libcds: Library of lock-free and fine-grained algorithms. http:\/\/libcds.sourceforge.net.  libcds: Library of lock-free and fine-grained algorithms. http:\/\/libcds.sourceforge.net."},{"key":"e_1_3_2_1_3_1","unstructured":"Intel Thread Building Blocks: a C++ template library for task parallelism. http:\/\/www.threadingbuildingblocks.org.  Intel Thread Building Blocks: a C++ template library for task parallelism. http:\/\/www.threadingbuildingblocks.org."},{"key":"e_1_3_2_1_4_1","unstructured":"Project voldemort: A distributed key-value storage system. http:\/\/project-voldemort.com.  Project voldemort: A distributed key-value storage system. http:\/\/project-voldemort.com."},{"key":"e_1_3_2_1_5_1","unstructured":"LevelDB a fast and lightweight key\/value database library by Google 2005. https:\/\/github.com\/google\/leveldb commit 2d0320a458d0e6a20fff46d5f80b18bfdcce7018.  LevelDB a fast and lightweight key\/value database library by Google 2005. https:\/\/github.com\/google\/leveldb commit 2d0320a458d0e6a20fff46d5f80b18bfdcce7018."},{"key":"e_1_3_2_1_6_1","unstructured":"HyperLevelDB a fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB 2014. https:\/\/github.com\/rescrv\/HyperLevelDB commit 40ce80173a8d72443c5f92e3c072a54ed910bab9.  HyperLevelDB a fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB 2014. https:\/\/github.com\/rescrv\/HyperLevelDB commit 40ce80173a8d72443c5f92e3c072a54ed910bab9."},{"key":"e_1_3_2_1_7_1","unstructured":"RocksDB hash-based memtable implementations 2014. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Hash-based-memtable-implementations.  RocksDB hash-based memtable implementations 2014. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Hash-based-memtable-implementations."},{"key":"e_1_3_2_1_8_1","unstructured":"CLHT a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets 2015. https:\/\/github.com\/LPD-EPFL\/CLHT.  CLHT a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets 2015. https:\/\/github.com\/LPD-EPFL\/CLHT."},{"key":"e_1_3_2_1_9_1","unstructured":"ASCYLIB a concurrent-search data-structure library with over 40 implementantions of linked lists hash tables skip lists binary search trees queues and stacks 2016. https:\/\/github.com\/LPD-EPFL\/ASCYLIB.  ASCYLIB a concurrent-search data-structure library with over 40 implementantions of linked lists hash tables skip lists binary search trees queues and stacks 2016. https:\/\/github.com\/LPD-EPFL\/ASCYLIB."},{"key":"e_1_3_2_1_10_1","unstructured":"Public implementation of the cLSM algorithm on top of RocksDB 2016. https:\/\/github.com\/guyg8\/rocksdb\/commits\/write_throughput.  Public implementation of the cLSM algorithm on top of RocksDB 2016. https:\/\/github.com\/guyg8\/rocksdb\/commits\/write_throughput."},{"key":"e_1_3_2_1_11_1","unstructured":"Apache HBase a distributed scalable big data store 2016. http:\/\/hbase.apache.org\/.  Apache HBase a distributed scalable big data store 2016. http:\/\/hbase.apache.org\/."},{"key":"e_1_3_2_1_12_1","unstructured":"RocksDB a persistent key-value store for fast storage environments 2016. http:\/\/rocksdb.org\/ commitefd013d6d8ef3607e9c004dee047726538f0163d.  RocksDB a persistent key-value store for fast storage environments 2016. http:\/\/rocksdb.org\/ commitefd013d6d8ef3607e9c004dee047726538f0163d."},{"key":"e_1_3_2_1_13_1","unstructured":"RocksDB commit describing how to enable cLSM features 2016. https:\/\/github.com\/facebook\/rocksdb\/commit\/7d87f02799bd0a8fd36df24fab5baa4968615c86.  RocksDB commit describing how to enable cLSM features 2016. https:\/\/github.com\/facebook\/rocksdb\/commit\/7d87f02799bd0a8fd36df24fab5baa4968615c86."},{"key":"e_1_3_2_1_14_1","unstructured":"RocksDB performance benchmarks 2016. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Performance-Benchmarks.  RocksDB performance benchmarks 2016. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Performance-Benchmarks."},{"key":"e_1_3_2_1_15_1","unstructured":"A. S. Aiyer M. Bautin G. J. Chen P. Damania P. Khemani K. Muthukkaruppan K. Ranganathan N. Spiegelberg L. Tang and M. Vaidya. Storage infrastructure behind facebook messages: Using HBase at scale. IEEE Data Engineering Bulletin 35(2) 2012.  A. S. Aiyer M. Bautin G. J. Chen P. Damania P. Khemani K. Muthukkaruppan K. Ranganathan N. Spiegelberg L. Tang and M. Vaidya. Storage infrastructure behind facebook messages: Using HBase at scale. IEEE Data Engineering Bulletin 35(2) 2012."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2318857.2254766"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933061"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454167"},{"key":"e_1_3_2_1_20_1","volume-title":"MIT Press","author":"Cormen T.","year":"2009"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2694344.2694359"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294281"},{"key":"e_1_3_2_1_23_1","volume-title":"Microsoft Windows Development Series. Pearson Education","author":"Duffy J.","year":"2008"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377681"},{"key":"e_1_3_2_1_25_1","volume-title":"NSDI","author":"Fan B.","year":"2013"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741973"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.472.0221"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_29_1","unstructured":"M. Herlihy and N. Shavit. The Art of Multiprocessor Programming Revised Reprint. Morgan Kaufmann Publishers Inc. 1st edition 2012.  M. Herlihy and N. Shavit. The Art of Multiprocessor Programming Revised Reprint. Morgan Kaufmann Publishers Inc. 1st edition 2012."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_31_1","unstructured":"H. Lim D. Han D. G. Andersen and M. Kaminsky. MICA: A holistic approach to fast in-memory key-value storage. management 15(32) 2014.  H. Lim D. Han D. G. Andersen and M. Kaminsky. MICA: A holistic approach to fast in-memory key-value storage. management 15(32) 2014."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Y. Mao E. Kohler and R. T. Morris. Cache craftiness for fast multi-core key-value storage. Eurosys 2012.  Y. Mao E. Kohler and R. T. Morris. Cache craftiness for fast multi-core key-value storage. Eurosys 2012.","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_3_2_1_33_1","volume-title":"PDCS","author":"McKenney P. E.","year":"1998"},{"key":"e_1_3_2_1_34_1","volume-title":"Ottawa Linux Symposium","author":"McKenney P. E.","year":"2001"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/65762.65765"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_39_1","volume-title":"ACM","author":"Sears R.","year":"2012"},{"key":"e_1_3_2_1_40_1","unstructured":"R. Sedgewick and K. Wayne. Algorithms. Pearson Education 4th edition 2014.  R. Sedgewick and K. Wayne. Algorithms. Pearson Education 4th edition 2014."},{"key":"e_1_3_2_1_41_1","volume-title":"Prentice Hall","author":"Tanenbaum A.","year":"2014"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093139.2093140"},{"key":"e_1_3_2_1_43_1","volume-title":"USENIX ATC","author":"Wu X.","year":"2015"}],"event":{"name":"EuroSys '17: Twelfth EuroSys Conference 2017","location":"Belgrade Serbia","acronym":"EuroSys '17","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the Twelfth European Conference on Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3064176.3064193","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3064176.3064193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:15Z","timestamp":1750217775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3064176.3064193"}},"subtitle":["Unlocking Memory in Persistent Key-Value Stores"],"short-title":[],"issued":{"date-parts":[[2017,4,23]]},"references-count":43,"alternative-id":["10.1145\/3064176.3064193","10.1145\/3064176"],"URL":"https:\/\/doi.org\/10.1145\/3064176.3064193","relation":{},"subject":[],"published":{"date-parts":[[2017,4,23]]},"assertion":[{"value":"2017-04-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}