{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:25Z","timestamp":1772163985310,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T00:00:00Z","timestamp":1181606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,12]]},"DOI":"10.1145\/1254882.1254916","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T12:07:37Z","timestamp":1189771657000},"page":"277-288","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Building high accuracy bloom filters using partitioned hashing"],"prefix":"10.1145","author":[{"given":"Fang","family":"Hao","sequence":"first","affiliation":[{"name":"Bell Laboratroies"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murali","family":"Kodialam","sequence":"additional","affiliation":[{"name":"Bell Laboratroies"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. V.","family":"Lakshman","sequence":"additional","affiliation":[{"name":"Bell Laboratroies"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_42"},{"key":"e_1_3_2_1_3_1","unstructured":"S. Lumetta and M. Mitzenmacher \"Using the power of two choices to improve Bloom filters\" Preprint version available at http:\/\/www.eecs.harvard.edu\/~michaelm.  S. Lumetta and M. Mitzenmacher \"Using the power of two choices to improve Bloom filters\" Preprint version available at http:\/\/www.eecs.harvard.edu\/~michaelm."},{"key":"e_1_3_2_1_4_1","first-page":"4","article-title":"Network applications fo Bloom filters: a survey","volume":"1","author":"Broder A.","year":"2005","unstructured":"A. Broder and M. Mitzenmacher , \" Network applications fo Bloom filters: a survey \", Internet Mathematics , vol. 1 . no. 4 , pp. 485--509, 2005 . A. Broder and M. Mitzenmacher, \"Network applications fo Bloom filters: a survey\", Internet Mathematics, vol. 1. no. 4, pp. 485--509, 2005.","journal-title":"Internet Mathematics"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_6_1","unstructured":"Robert Sedgewick \"Algorithms in C\" Addison-Wesley Professional August 2001.  Robert Sedgewick \"Algorithms in C\" Addison-Wesley Professional August 2001."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780633"},{"key":"e_1_3_2_1_8_1","volume-title":"SODA","author":"Pagh A.","year":"2005","unstructured":"A. Pagh , R. Pagh , and S. Rao , \" An optimal Bloom filter replacement \", SODA 2005 . A. Pagh, R. Pagh, and S. Rao, \"An optimal Bloom filter replacement\", SODA 2005."},{"key":"e_1_3_2_1_9_1","volume-title":"SODA","author":"Chazelle B.","year":"2004","unstructured":"B. Chazelle , J. Kilian , R. Rubinfeld , and A. Tal , \" The Bloomier filter: an efficient data structure for static support lookup tables \", SODA 2004 . B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal, \"The Bloomier filter: an efficient data structure for static support lookup tables\", SODA 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-4048(92)90207-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00032-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159950"}],"event":{"name":"SIGMETRICS07: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","location":"San Diego California USA","acronym":"SIGMETRICS07","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1254882.1254916","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1254882.1254916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:43Z","timestamp":1750243663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1254882.1254916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,12]]},"references-count":14,"alternative-id":["10.1145\/1254882.1254916","10.1145\/1254882"],"URL":"https:\/\/doi.org\/10.1145\/1254882.1254916","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1269899.1254916","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,6,12]]},"assertion":[{"value":"2007-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}