{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:09:45Z","timestamp":1767182985649,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T00:00:00Z","timestamp":1219017600000},"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":[[2008,8,18]]},"DOI":"10.1145\/1400751.1400798","type":"proceedings-article","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T12:38:39Z","timestamp":1219149519000},"page":"355-364","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Optimizing data popularity conscious bloom filters"],"prefix":"10.1145","author":[{"given":"Ming","family":"Zhong","sequence":"first","affiliation":[{"name":"Google, Inc., Mountain View, CA, USA"}]},{"given":"Pin","family":"Lu","sequence":"additional","affiliation":[{"name":"University of Rochester, Rochester, USA"}]},{"given":"Kai","family":"Shen","sequence":"additional","affiliation":[{"name":"University of Rochester, Rochester, USA"}]},{"given":"Joel","family":"Seiferas","sequence":"additional","affiliation":[{"name":"University of Rochester, Rochester, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,8,18]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"92","volume-title":"Characterizing reference locality in the WWW. In the 4th Int'l Conf. on Parallel and Distributed Information Systems","author":"Almeida V.","year":"1996","unstructured":"V. Almeida , A. Bestavros , M. Crovella , and A. de Oliveira . Characterizing reference locality in the WWW. In the 4th Int'l Conf. on Parallel and Distributed Information Systems , pages 92 -- 103 , 1996 . V. Almeida, A. Bestavros, M. Crovella, and A. de Oliveira. Characterizing reference locality in the WWW. In the 4th Int'l Conf. on Parallel and Distributed Information Systems, pages 92--103, 1996."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_3_1","volume-title":"July","author":"Bruck J.","year":"2006","unstructured":"J. Bruck , J. Gao , and A. Jiang . Weighted Bloom filters. In the IEEE Int'l Symp. on Information Theory , July 2006 . J. Bruck, J. Gao, and A. Jiang. Weighted Bloom filters. In the IEEE Int'l Symp. on Information Theory, July 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633031"},{"key":"e_1_3_2_1_5_1","first-page":"30","volume-title":"the 15th Symp. on Distributed Algorithms","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 . In the 15th Symp. on Distributed Algorithms , pages 30 -- 39 , 2004 . B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The Bloomier filter: An efficient data structure for static support lookup tables. In the 15th Symp. on Distributed Algorithms, pages 30--39, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872787"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1254882.1254916"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.1.1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_42"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740836"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498343"},{"key":"e_1_3_2_1_15_1","volume-title":"On the feasibility of peer-to-peer web indexing and search. In the 2nd Int'l Workshop on Peer-to-Peer Systems","author":"Li J.","year":"2003","unstructured":"J. Li , T. Loo , J. Hellerstein , F. Kaashoek , D.R. Karger , and R. Morris . On the feasibility of peer-to-peer web indexing and search. In the 2nd Int'l Workshop on Peer-to-Peer Systems , 2003 . J. Li, T. Loo, J. Hellerstein, F. Kaashoek, D.R. Karger, and R. Morris. On the feasibility of peer-to-peer web indexing and search. In the 2nd Int'l Workshop on Peer-to-Peer Systems, 2003."},{"key":"e_1_3_2_1_16_1","first-page":"149","volume-title":"R* optimizer validation and performance evaluation for distributed queries. In the 12th Int'l Conf. on Very Large Data Bases","author":"Mackert L. F.","year":"1986","unstructured":"L. F. Mackert and G. M. Lohman . R* optimizer validation and performance evaluation for distributed queries. In the 12th Int'l Conf. on Very Large Data Bases , pages 149 -- 159 , 1986 . L. F. Mackert and G. M. Lohman. R* optimizer validation and performance evaluation for distributed queries. In the 12th Int'l Conf. on Very Large Data Bases, pages 149--159, 1986."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00032-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.52778"},{"key":"e_1_3_2_1_20_1","first-page":"823","volume-title":"the 16th ACM Symp. on Discrete Algorithms","author":"Pagh A.","year":"2005","unstructured":"A. Pagh , R. Pagh , and S. S. Rao . An optimal Bloom filter replacement . In the 16th ACM Symp. on Discrete Algorithms , pages 823 -- 829 , 2005 . A. Pagh, R. Pagh, and S. S. Rao. An optimal Bloom filter replacement. In the 16th ACM Symp. on Discrete Algorithms, pages 823--829, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/954339.954341"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/67933.67941"},{"key":"e_1_3_2_1_23_1","first-page":"21","volume-title":"Middleware","author":"Reynold P.","year":"2003","unstructured":"P. Reynold and A. Vahdat . Efficient peer-to-peer keyword searching . In Middleware , pages 21 -- 40 , 2003 . P. Reynold and A. Vahdat. Efficient peer-to-peer keyword searching. In Middleware, pages 21--40, 2003."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019375"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-4048(92)90207-8"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352592.1352599"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.60"}],"event":{"name":"PODC '08: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Toronto Canada","acronym":"PODC '08"},"container-title":["Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1400751.1400798","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1400751.1400798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:23Z","timestamp":1750258043000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1400751.1400798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,18]]},"references-count":27,"alternative-id":["10.1145\/1400751.1400798","10.1145\/1400751"],"URL":"https:\/\/doi.org\/10.1145\/1400751.1400798","relation":{},"subject":[],"published":{"date-parts":[[2008,8,18]]},"assertion":[{"value":"2008-08-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}