{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:41:10Z","timestamp":1742971270770,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181226"},{"type":"electronic","value":"9783319181233"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18123-3_21","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T07:51:48Z","timestamp":1428479508000},"page":"346-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Improved Weighted Bloom Filter and Space Lower Bound Analysis of Algorithms for Approximated Membership Querying"],"prefix":"10.1007","author":[{"given":"Xiujun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yusheng","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Zhe","family":"Dang","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Baohua","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0304-3975(95)00157-3","volume":"157","author":"F Ablayev","year":"1996","unstructured":"Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science 157, 139\u2013159 (1996)","journal-title":"Theoretical Computer Science"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Jayram, T., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity, vol. 68, pp. 702\u2013732. Academic Press Inc. (2004)","DOI":"10.1016\/j.jcss.2003.11.006"},{"issue":"4","key":"21_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/1862919.1862923","volume":"35","author":"R Berinde","year":"2010","unstructured":"Berinde, R., Indyk, P., Cormode, G., Strauss, M.J.: Space-optimal heavy hitters with strong error bounds. ACM Transactions on Database Systems (TODS) 35(4), 26 (2010)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"7","key":"21_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrah, R., Singh, S., Varghese, G.: Beyond bloom filters: from approximate membership checks to approximate state machines. In: ACM SIGCOMM Computer Communication Review, vol.36, pp. 315\u2013326. ACM (2006)","DOI":"10.1145\/1151659.1159950"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/11841036_61","volume-title":"Algorithms \u2013 ESA 2006","author":"F Bonomi","year":"2006","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 684\u2013695. Springer, Heidelberg (2006)"},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. Internet Mathematics 1(4), 485\u2013509 (2004)","journal-title":"Internet Mathematics"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Bruck, J., Gao, J., Jiang, A.: Weighted bloom filter. In: 2006 IEEE International Symposium on Information Theory, pp. 2304\u20132308. IEEE (2006). Extented version in http:\/\/www.paradise.caltech.edu\/papers\/etr072.pdf","DOI":"10.1109\/ISIT.2006.261978"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Carter, L., Floyd, R., Gill, J., Markowsky, G., Wegman, M.: Exact and approximate membership testers. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 59\u201365. ACM (1978)","DOI":"10.1145\/800133.804332"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K., Chaudhuri, S., Ganti, V., Xin, D.: An efficient filter for approximate membership checking. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 805\u2013818. ACM (2008)","DOI":"10.1145\/1376616.1376697"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/15427951.2006.10129115","volume":"3","author":"F Chung","year":"2006","unstructured":"Chung, F., Lu, L.: Concentration inequalities and martingale inequalities: a survey. Internet Mathematics 3(1), 79\u2013127 (2006)","journal-title":"Internet Mathematics"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00778-009-0172-z","volume":"19","author":"G Cormode","year":"2010","unstructured":"Cormode, G., Hadjieleftheriou, M.: Methods for finding frequent items in data streams. The VLDB Journal 19(1), 3\u201320 (2010)","journal-title":"The VLDB Journal"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. ACM Transactions on Database Systems (TODS) 30(1), 249\u2013278 (2005)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45749-6_33","volume-title":"Algorithms - ESA 2002","author":"ED Demaine","year":"2002","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 348\u2013360. Springer, Heidelberg (2002)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Deng, F., Rafiei, D.: Approximately detecting duplicates for streaming data using stable bloom filters. In: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, pp. 25\u201336. ACM (2006)","DOI":"10.1145\/1142473.1142477"},{"issue":"10","key":"21_CR16","doi-asserted-by":"publisher","first-page":"2367","DOI":"10.1109\/TKDE.2012.215","volume":"25","author":"D Guo","year":"2013","unstructured":"Guo, D., Li, M.: Set reconciliation via counting bloom filters. IEEE Transactions on Knowledge and Data Engineering 25(10), 2367\u20132380 (2013)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"5","key":"21_CR17","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1109\/TKDE.2009.209","volume":"22","author":"D Guo","year":"2010","unstructured":"Guo, D., Liu, Y., Li, X., Yang, P.: False negative problem of counting bloom filter. IEEE Transactions on Knowledge and Data Engineering 22(5), 651\u2013664 (2010)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TKDE.2009.57","volume":"22","author":"D Guo","year":"2010","unstructured":"Guo, D., Wu, J., Chen, H., Yuan, Y., Luo, X.: The dynamic bloom filters. IEEE Transactions on Knowledge and Data Engineering 22(1), 120\u2013133 (2010)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"21_CR19","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1109\/TC.2011.108","volume":"61","author":"Y Hua","year":"2012","unstructured":"Hua, Y., Xiao, B., Veeravalli, B., Feng, D.: Locality-sensitive bloom filter for approximate membership query. IEEE Transactions on Computers 61(6), 817\u2013830 (2012)","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Jayram, T.: Information complexity: a tutorial. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 159\u2013168. ACM (2010)","DOI":"10.1145\/1807085.1807108"},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems (TODS) 28(1), 51\u201355 (2003)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11841036_42","volume-title":"Algorithms \u2013 ESA 2006","author":"A Kirsch","year":"2006","unstructured":"Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: building a better bloom filter. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 456\u2013467. Springer, Heidelberg (2006)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Y., Chen, W., Guan, Y.: Near-optimal approximate membership query over time-decaying windows. In: 2013 Proceedings IEEE, INFOCOM, pp. 1447\u20131455. IEEE (2013)","DOI":"10.1109\/INFCOM.2013.6566939"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Duplicate detection in click streams. In: Proceedings of the 14th International Conference on World Wide Web, pp. 12\u201321. ACM (2005)","DOI":"10.1145\/1060745.1060753"},{"issue":"2","key":"21_CR25","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. Journal of Algorithms 51(2), 122\u2013144 (2004)","journal-title":"Journal of Algorithms"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Zhong, M., Lu, P., Shen, K., Seiferas, J.: Optimizing data popularity conscious bloom filters. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, pp. 355\u2013364. ACM (2008)","DOI":"10.1145\/1400751.1400798"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18123-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:10:35Z","timestamp":1676938235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18123-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181226","9783319181233"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18123-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}