{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T16:24:53Z","timestamp":1764433493825,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FCT - Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UIDB\/50014\/2020"],"award-info":[{"award-number":["UIDB\/50014\/2020"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,3,27]]},"DOI":"10.1145\/3555776.3577791","type":"proceedings-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T17:16:29Z","timestamp":1686158189000},"page":"1285-1288","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Time-limited Bloom Filter"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1546-6690","authenticated-orcid":false,"given":"Ana","family":"Rodrigues","sequence":"first","affiliation":[{"name":"HASLab, INESC TEC, Braga, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4378-8814","authenticated-orcid":false,"given":"Ariel","family":"Shtul","sequence":"additional","affiliation":[{"name":"Redis Labs, Tel Aviv, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3933-6850","authenticated-orcid":false,"given":"Carlos","family":"Baquero","sequence":"additional","affiliation":[{"name":"FEUP, Universidade do Porto, Porto, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7000-0485","authenticated-orcid":false,"given":"Paulo S\u00e9rgio","family":"Almeida","sequence":"additional","affiliation":[{"name":"DI, Universidade do Minho, Braga, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"volume-title":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. 2204--2212","author":"Assaf E.","key":"e_1_3_2_1_1_1","unstructured":"E. Assaf , R. B. Basat , G. Einziger , and R. Friedman . 2018. Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free . In IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. 2204--2212 . E. Assaf, R. B. Basat, G. Einziger, and R. Friedman. 2018. Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free. In IEEE INFOCOM 2018 - IEEE Conference on Computer Communications. 2204--2212."},{"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","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213884"},{"key":"e_1_3_2_1_4_1","volume-title":"Survey: Network Applications of Bloom Filters: A Survey. Internet Mathematics 1 (Nov","author":"Broder A.","year":"2003","unstructured":"A. Broder and M. Mitzenmacher . 2003 . Survey: Network Applications of Bloom Filters: A Survey. Internet Mathematics 1 (Nov 2003). A. Broder and M. Mitzenmacher. 2003. Survey: Network Applications of Bloom Filters: A Survey. Internet Mathematics 1 (Nov 2003)."},{"volume-title":"Proceedings of the 12th International Conference on World Wide Web. 679--689","author":"Broder A. Z.","key":"e_1_3_2_1_5_1","unstructured":"A. Z. Broder , M. Najork , and J. L. Wiener . 2003. Efficient URL Caching for World Wide Web Crawling . In Proceedings of the 12th International Conference on World Wide Web. 679--689 . A. Z. Broder, M. Najork, and J. L. Wiener. 2003. Efficient URL Caching for World Wide Web Crawling. In Proceedings of the 12th International Conference on World Wide Web. 679--689."},{"key":"e_1_3_2_1_6_1","volume-title":"IEEE INFOCOM","volume":"4","author":"Chang F.","year":"2004","unstructured":"F. Chang , W. Feng , and K. Li . 2004. Approximate caches for packet classification . In IEEE INFOCOM 2004 , Vol. 4 . 2196--2207. F. Chang, W. Feng, and K. Li. 2004. Approximate caches for packet classification. In IEEE INFOCOM 2004, Vol. 4. 2196--2207."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.876157"},{"volume-title":"Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data. 25--36","author":"Deng F.","key":"e_1_3_2_1_8_1","unstructured":"F. Deng and D. Rafiei . 2006. Approximately detecting duplicates for streaming data using stable bloom filters . In Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data. 25--36 . F. Deng and D. Rafiei. 2006. Approximately detecting duplicates for streaming data using stable bloom filters. In Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data. 25--36."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"G. Einziger and R. Friedman. 2019. Counting With Tinytable: Every Bit Counts! IEEE Access 7 (2019) 166292--166309.  G. Einziger and R. Friedman. 2019. Counting With Tinytable: Every Bit Counts! IEEE Access 7 (2019) 166292--166309.","DOI":"10.1109\/ACCESS.2019.2925030"},{"volume-title":"Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies. 75--88","author":"Fan B.","key":"e_1_3_2_1_10_1","unstructured":"B. Fan , D. G. Andersen , M. Kaminsky , and M. D. Mitzenmacher . 2014. Cuckoo Filter: Practically Better Than Bloom . In Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies. 75--88 . B. Fan, D. G. Andersen, M. Kaminsky, and M. D. Mitzenmacher. 2014. Cuckoo Filter: Practically Better Than Bloom. In Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies. 75--88."},{"key":"e_1_3_2_1_11_1","first-page":"3","article-title":"Summary cache: a scalable wide-area Web cache sharing protocol","volume":"8","author":"Fan L.","year":"2000","unstructured":"L. Fan , P. Cao , J. Almeida , and A. Z. Broder . 2000 . Summary cache: a scalable wide-area Web cache sharing protocol . IEEE\/ACM Transactions on Networking 8 , 3 (Jun 2000), 281--293. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. 2000. Summary cache: a scalable wide-area Web cache sharing protocol. IEEE\/ACM Transactions on Networking 8, 3 (Jun 2000), 281--293.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019213109274"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/16856.16863"},{"volume-title":"Proceedings of the 14th International Conference on World Wide Web. 12--21","author":"Metwally A.","key":"e_1_3_2_1_14_1","unstructured":"A. Metwally , D. Agrawal , and A. El Abbadi . 2005. Duplicate Detection in Click Streams . In Proceedings of the 14th International Conference on World Wide Web. 12--21 . A. Metwally, D. Agrawal, and A. El Abbadi. 2005. Duplicate Detection in Click Streams. In Proceedings of the 14th International Conference on World Wide Web. 12--21."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_1_16_1","unstructured":"A. Shtul C. Baquero and P. S. Almeida. 2020. Age-Partitioned Bloom Filters. CoRR abs\/2001.03147 (Jan 2020). arXiv:2001.03147 http:\/\/arxiv.org\/abs\/2001.03147  A. Shtul C. Baquero and P. S. Almeida. 2020. Age-Partitioned Bloom Filters. CoRR abs\/2001.03147 (Jan 2020). arXiv:2001.03147 http:\/\/arxiv.org\/abs\/2001.03147"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.804827"},{"volume-title":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage. 382--391","author":"Wei J.","key":"e_1_3_2_1_18_1","unstructured":"J. Wei , H. Jiang , K. Zhou , D. Feng , and H. Wang . 2011. Detecting Duplicates over Sliding Windows with RAM-Efficient Detached Counting Bloom Filter Arrays . In 2011 IEEE Sixth International Conference on Networking, Architecture, and Storage. 382--391 . J. Wei, H. Jiang, K. Zhou, D. Feng, and H. Wang. 2011. Detecting Duplicates over Sliding Windows with RAM-Efficient Detached Counting Bloom Filter Arrays. In 2011 IEEE Sixth International Conference on Networking, Architecture, and Storage. 382--391."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.136"},{"volume-title":"Proceedings of the 28th International Conference on Very Large Data Bases. 358--369","author":"Zhu Y.","key":"e_1_3_2_1_20_1","unstructured":"Y. Zhu and D. Shasha . 2002. StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time . In Proceedings of the 28th International Conference on Very Large Data Bases. 358--369 . Y. Zhu and D. Shasha. 2002. StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time. In Proceedings of the 28th International Conference on Very Large Data Bases. 358--369."}],"event":{"name":"SAC '23: 38th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Tallinn Estonia","acronym":"SAC '23"},"container-title":["Proceedings of the 38th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555776.3577791","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3555776.3577791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:30Z","timestamp":1750183710000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555776.3577791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,27]]},"references-count":20,"alternative-id":["10.1145\/3555776.3577791","10.1145\/3555776"],"URL":"https:\/\/doi.org\/10.1145\/3555776.3577791","relation":{},"subject":[],"published":{"date-parts":[[2023,3,27]]},"assertion":[{"value":"2023-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}