{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:33:43Z","timestamp":1773275623380,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,9]],"date-time":"2017-05-09T00:00:00Z","timestamp":1494288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006234","name":"Sandia National Laboratories","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006234","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1247726, IIS-1251137, CNS-1408695, CCF-1439084, CCF-1617618, BBSRC-NSF\/BIO-1564917"],"award-info":[{"award-number":["IIS-1247726, IIS-1251137, CNS-1408695, CCF-1439084, CCF-1617618, BBSRC-NSF\/BIO-1564917"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,9]]},"DOI":"10.1145\/3035918.3035963","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"775-787","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":125,"title":["A General-Purpose Counting Filter"],"prefix":"10.1145","author":[{"given":"Prashant","family":"Pandey","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"given":"Rob","family":"Johnson","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]},{"given":"Rob","family":"Patro","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,5,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"vesca genome read dataset. ftp:\/\/ftp.ddbj.nig.ac.jp\/ddbj_database\/dra\/fastq\/SRA020\/SRA020125\/SRX030576\/SRR072006.fastq.bz2. {Online","author":"F.","year":"2016","unstructured":"F. vesca genome read dataset. ftp:\/\/ftp.ddbj.nig.ac.jp\/ddbj_database\/dra\/fastq\/SRA020\/SRA020125\/SRX030576\/SRR072006.fastq.bz2. {Online ; accessed 19- February - 2016 }. F. vesca genome read dataset. ftp:\/\/ftp.ddbj.nig.ac.jp\/ddbj_database\/dra\/fastq\/SRA020\/SRA020125\/SRX030576\/SRR072006.fastq.bz2. {Online; accessed 19-February-2016}."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500128"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.10.007"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732958"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1237-z"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_1_10_1","first-page":"1","volume-title":"Proceedings of the International Workshop on Accelerating Analytics and Data Management Systems Using Modern Processor and Storage Architectures (ADMS)","author":"Canim M.","year":"2010","unstructured":"M. Canim , G. A. Mihaila , B. Bhattacharjee , C. A. Lang , and K. A. Ross . Buffered Bloom filters on solid state storage . In Proceedings of the International Workshop on Accelerating Analytics and Data Management Systems Using Modern Processor and Storage Architectures (ADMS) , pages 1 -- 8 , 2010 . M. Canim, G. A. Mihaila, B. Bhattacharjee, C. A. Lang, and K. A. Ross. Buffered Bloom filters on solid state storage. In Proceedings of the International Workshop on Accelerating Analytics and Data Management Systems Using Modern Processor and Storage Architectures (ADMS), pages 1--8, 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872787"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.011102"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.44"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the USENIX Annual Technical Conference (ATC)","author":"Debnath B. K.","year":"2010","unstructured":"B. K. Debnath , S. Sengupta , and J. Li . Chunkstash: Speeding up inline storage deduplication using flash memory . In Proceedings of the USENIX Annual Technical Conference (ATC) , 2010 . B. K. Debnath, S. Sengupta, and J. Li. Chunkstash: Speeding up inline storage deduplication using flash memory. In Proceedings of the USENIX Annual Technical Conference (ATC), 2010."},{"key":"e_1_3_2_1_16_1","volume-title":"Cuckoo filter source code in C++. https:\/\/github.com\/efficient\/cuckoofilter","author":"Fan B.","year":"2014","unstructured":"B. Fan . Cuckoo filter source code in C++. https:\/\/github.com\/efficient\/cuckoofilter , 2014 . {Online; accessed 19-July-2014}. B. Fan. Cuckoo filter source code in C++. https:\/\/github.com\/efficient\/cuckoofilter, 2014. {Online; accessed 19-July-2014}."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_19_1","unstructured":"A. Geil. Quotient filters: Approximate membership queries on the GPU. http:\/\/on-demand.gputechconf.com\/gtc\/2016\/presentation\/s6464-afton-geil-quoetient-filters.pdf 2016.  A. Geil. Quotient filters: Approximate membership queries on the GPU. http:\/\/on-demand.gputechconf.com\/gtc\/2016\/presentation\/s6464-afton-geil-quoetient-filters.pdf 2016."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.41"},{"key":"e_1_3_2_1_21_1","volume-title":"Poster Proceedings","volume":"38","author":"Gonz\u00e1lez R.","year":"2005","unstructured":"R. Gonz\u00e1lez , S. Grabowski , V. M\u00e4kinen , and G. Navarro . Practical implementation of rank and select queries . In Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA), pages 27-- 38 , 2005 . R. Gonz\u00e1lez, S. Grabowski, V. M\u00e4kinen, and G. Navarro. Practical implementation of rank and select queries. In Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA), pages 27--38, 2005."},{"key":"e_1_3_2_1_22_1","volume-title":"http:\/\/firehose.sandia.gov\/","author":"Karl Anderson S. P.","year":"2013","unstructured":"S. P. Karl Anderson . Firehose. http:\/\/firehose.sandia.gov\/ , 2013 . {Online; accessed 19-Dec-2015}. S. P. Karl Anderson. Firehose. http:\/\/firehose.sandia.gov\/, 2013. {Online; accessed 19-Dec-2015}."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2011.5937232"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-333"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_26_1","volume-title":"https:\/\/code.google.com\/p\/bloom\/. {Online","author":"Partow A.","year":"2014","unstructured":"A. Partow . C++ Bloom filter library. https:\/\/code.google.com\/p\/bloom\/. {Online ; accessed 19- July - 2014 }. A. Partow. C++Bloom filter library. https:\/\/code.google.com\/p\/bloom\/. {Online; accessed 19-July-2014}."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1768570.1768582"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.46"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu132"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"e_1_3_2_1_31_1","volume-title":"https:\/\/github.com\/mavam\/libbf","author":"Vallentin M.","year":"2014","unstructured":"M. Vallentin . Counting Bloom filter source code in C++. https:\/\/github.com\/mavam\/libbf , 2014 . {Online; accessed 19-July-2015}. M. Vallentin. Counting Bloom filter source code in C++. https:\/\/github.com\/mavam\/libbf, 2014. {Online; accessed 19-July-2015}."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592804"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0101271"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1364813.1364831"}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","location":"Chicago Illinois USA","acronym":"SIGMOD\/PODS'17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2017 ACM International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3035963","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3035963","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3035963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:48Z","timestamp":1750217808000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3035963"}},"subtitle":["Making Every Bit Count"],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":34,"alternative-id":["10.1145\/3035918.3035963","10.1145\/3035918"],"URL":"https:\/\/doi.org\/10.1145\/3035918.3035963","relation":{},"subject":[],"published":{"date-parts":[[2017,5,9]]},"assertion":[{"value":"2017-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}