{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T12:05:27Z","timestamp":1775304327107,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642450297","type":"print"},{"value":"9783642450303","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_48","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"513-523","source":"Crossref","is-referenced-by-count":10,"title":["Sliding Bloom Filters"],"prefix":"10.1007","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eylon","family":"Yogev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Arbitman, Y., Naor, M., Segev, G.: Backyard cuckoo hashing: Constant worst-case operations with a succinct representation. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 787\u2013796. IEEE (2010)","DOI":"10.1109\/FOCS.2010.80"},{"issue":"7","key":"48_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"48_CR3","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. In: Internet Mathematics, pp. 636\u2013646 (2002)"},{"key":"48_CR4","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":"48_CR5","doi-asserted-by":"crossref","unstructured":"Chang, F., Feng, W.-C., Li, K.: Approximate caches for packet classification. In: Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2004, vol.\u00a04, pp. 2196\u20132207. IEEE (2004)","DOI":"10.1109\/INFCOM.2004.1354643"},{"issue":"6","key":"48_CR6","doi-asserted-by":"crossref","first-page":"1794","DOI":"10.1137\/S0097539701398363","volume":"31","author":"M. Datar","year":"2002","unstructured":"Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. SIAM Journal on Computing\u00a031(6), 1794\u20131813 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-70575-8_32","volume-title":"Automata, Languages and Programming","author":"M. Dietzfelbinger","year":"2008","unstructured":"Dietzfelbinger, M., Pagh, R.: Succinct data structures for retrieval and approximate membership. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 385\u2013396. Springer, Heidelberg (2008)"},{"key":"48_CR8","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":"3","key":"48_CR9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L. Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Netw.\u00a08(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Lovett, S., Porat, E.: A lower bound for dynamic approximate membership data structures. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 797\u2013804. IEEE (2010)","DOI":"10.1109\/FOCS.2010.81"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E.: 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"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Naor, M., Yogev, E.: Sliding bloom filters. CoRR, abs\/1304.5872 (2013)","DOI":"10.1007\/978-3-642-45030-3_48"},{"key":"48_CR13","unstructured":"Pagh, A., Pagh, R., Srinivasa Rao, S.: An optimal bloom filter replacement. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 823\u2013829. Society for Industrial and Applied Mathematics (2005)"},{"key":"48_CR14","first-page":"1304","volume":"arXiv","author":"R. Pagh","year":"2013","unstructured":"Pagh, R., Segev, G., Wieder, U.: How to approximate a set without knowing its size in advance. arXiv preprint arXiv:1304.1188 (2013)","journal-title":"arXiv preprint"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Timeouts with time-reversed linear probing. In: INFOCOM, pp. 166\u2013170 (2011)","DOI":"10.1109\/INFCOM.2011.5934961"},{"issue":"1","key":"48_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/SURV.2011.031611.00024","volume":"14","author":"S. Tarkoma","year":"2012","unstructured":"Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and practice of bloom filters for distributed systems. IEEE Communications Surveys & Tutorials\u00a014(1), 131\u2013155 (2012)","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"1","key":"48_CR17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/TKDE.2009.136","volume":"22","author":"M.K. Yoon","year":"2010","unstructured":"Yoon, M.K.: Aging bloom filter with two active buffers for dynamic sets. IEEE Transactions on Knowledge and Data Engineering\u00a022(1), 134\u2013138 (2010)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, L., Guan, Y.: Detecting click fraud in pay-per-click streams of online advertising networks. In: ICDCS, pp. 77\u201384 (2008)","DOI":"10.1109\/ICDCS.2008.98"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:24:41Z","timestamp":1746073481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}