{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T21:07:26Z","timestamp":1774732046489,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T00:00:00Z","timestamp":1417478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473"],"award-info":[{"award-number":["CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473"],"award-info":[{"award-number":["CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473"],"award-info":[{"award-number":["CCF-0964474, CNS-1040801, CCF-1320231, CNS-1228598, and IIS-0964473"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,12,2]]},"DOI":"10.1145\/2674005.2674994","type":"proceedings-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T16:30:28Z","timestamp":1418056228000},"page":"75-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":602,"title":["Cuckoo Filter"],"prefix":"10.1145","author":[{"given":"Bin","family":"Fan","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Dave G.","family":"Andersen","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Michael","family":"Kaminsky","sequence":"additional","affiliation":[{"name":"Intel Corp., Pittsburgh, PA, USA"}]},{"given":"Michael D.","family":"Mitzenmacher","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,12,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"CityHash. https:\/\/code.google.com\/p\/cityhash\/.  CityHash. https:\/\/code.google.com\/p\/cityhash\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159950"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_3_2_1_6_1","first-page":"636","volume-title":"Internet Mathematics","volume":"1","author":"Broder A.","year":"2002","unstructured":"A. Broder , M. Mitzenmacher , and A. Broder . Network Applications of Bloom Filters: A Survey . In Internet Mathematics , volume 1 , pages 636 -- 646 , 2002 . A. Broder, M. Mitzenmacher, and A. Broder. Network Applications of Bloom Filters: A Survey. In Internet Mathematics, volume 1, pages 636--646, 2002."},{"key":"e_1_3_2_1_7_1","first-page":"30","volume-title":"Proceedings of SODA","author":"Chazelle B.","year":"2004","unstructured":"B. Chazelle , J. Kilian , R. Rubinfeld , A. Tal , and O. Boy . The Bloomier filter: An efficient data structure for static support lookup tables . In Proceedings of SODA , pages 30 -- 39 , 2004 . B. Chazelle, J. Kilian, R. Rubinfeld, A. Tal, and O. Boy. The Bloomier filter: An efficient data structure for static support lookup tables. In Proceedings of SODA, pages 30--39, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676499"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863979"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.054"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. 10th USENIX NSDI","author":"Fan B.","year":"2013","unstructured":"B. Fan , D. G. Andersen , and M. Kaminsky . MemC3: Compact and concurrent memcache with dumber caching and smarter hashing . In Proc. 10th USENIX NSDI , Lombard, IL , Apr. 2013 . B. Fan, D. G. Andersen, and M. Kaminsky. MemC3: Compact and concurrent memcache with dumber caching and smarter hashing. In Proc. 10th USENIX NSDI, Lombard, IL, Apr. 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/285237.285287"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133129"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2008.4697026"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592592"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v33:2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043558"},{"key":"e_1_3_2_1_18_1","first-page":"255","volume-title":"Handbook of Randomized Computing","author":"Mitzenmacher M.","year":"2000","unstructured":"M. Mitzenmacher , A. W. Richa , and R. Sitaraman . The power of two random choices: A survey of techniques and results . In Handbook of Randomized Computing , pages 255 -- 312 . Kluwer , 2000 . M. Mitzenmacher, A. W. Richa, and R. Sitaraman. The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing, pages 255--312. Kluwer, 2000."},{"key":"e_1_3_2_1_19_1","first-page":"326","volume-title":"Proc. the Annual Allerton Conference on Communication Control and Computing","volume":"37","author":"Mitzenmacher M.","year":"1999","unstructured":"M. Mitzenmacher and B. Vocking . The asymptotics of selecting the shortest of two, improved . In Proc. the Annual Allerton Conference on Communication Control and Computing , volume 37 , pages 326 -- 327 , 1999 . M. Mitzenmacher and B. Vocking. The asymptotics of selecting the shortest of two, improved. In Proc. the Annual Allerton Conference on Communication Control and Computing, volume 37, pages 326--327, 1999."},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. ASM-SIAM Symposium on Discrete Algorithms, SODA","author":"Pagh A.","year":"2005","unstructured":"A. Pagh , R. Pagh , and S. S. Rao . An optimal bloom filter replacement . In Proc. ASM-SIAM Symposium on Discrete Algorithms, SODA , 2005 . A. Pagh, R. Pagh, and S. S. Rao. An optimal bloom filter replacement. In Proc. ASM-SIAM Symposium on Discrete Algorithms, SODA, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1768570.1768582"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1331699.1331713"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080114"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658975"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535379"}],"event":{"name":"CoNEXT '14: Conference on emerging Networking Experiments and Technologies","location":"Sydney Australia","acronym":"CoNEXT '14","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2674005.2674994","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2674005.2674994","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:03Z","timestamp":1750227423000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2674005.2674994"}},"subtitle":["Practically Better Than Bloom"],"short-title":[],"issued":{"date-parts":[[2014,12,2]]},"references-count":26,"alternative-id":["10.1145\/2674005.2674994","10.1145\/2674005"],"URL":"https:\/\/doi.org\/10.1145\/2674005.2674994","relation":{},"subject":[],"published":{"date-parts":[[2014,12,2]]},"assertion":[{"value":"2014-12-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}