Time-limited Bloom Filter-Reference-Cited by-同舟云学术

Time-limited Bloom Filter

Published:2023-03-27 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing
language:
Short-container-title:

Author:

Rodrigues Ana¹^ORCID,Shtul Ariel²^ORCID,Baquero Carlos³^ORCID,Almeida Paulo Sérgio⁴^ORCID

Affiliation:

1. HASLab, INESC TEC, Braga, Portugal

2. Redis Labs, Tel Aviv, Israel

3. FEUP, Universidade do Porto, Porto, Portugal

4. DI, Universidade do Minho, Braga, Portugal

Funder

FCT - Fundação para a Ciência e a Tecnologia

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3555776.3577791

Reference20 articles.

1. 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.

2. Space/time trade-offs in hash coding with allowable errors

3. Morton filters

4. 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).

5. 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.