Scalable Bloom Filters-Reference-Cited by-同舟云学术

Scalable Bloom Filters

Published:2007-03 Issue:6 Volume:101 Page:255-261
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Almeida Paulo Sérgio,Baquero Carlos,Preguiça Nuno,Hutchison David

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference13 articles.

1. Space/time trade-offs in hash coding with allowable errors;Bloom;Comm. ACM,1970

2. Approximate caches for packet classification;Chang,2004

3. Efficient peer-to-peer keyword searching;Reynolds,2003

4. S.C. Rhea, J. Kubiatowicz, Probabilistic location and routing, in: Proc. of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), 2002

5. Summary cache: A scalable wide-area web cache sharing protocol;Fan;IEEE/ACM Trans. Networks,2000

Cited by 124 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Aleph Filter: To Infinity in Constant Time;Proceedings of the VLDB Endowment;2024-07

2. Beyond Bloom: A Tutorial on Future Feature-Rich Filters;Companion of the 2024 International Conference on Management of Data;2024-06-09

3. Efficient Data Structures and Algorithms for Cloud Computing Platforms;2024 4th International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE);2024-05-14

4. The role of classifiers and data complexity in learned Bloom filters: insights and recommendations;Journal of Big Data;2024-03-27

5. A Bloom-Filter-Based Unique Address Checking Approach for DAG-Based Blockchain Systems;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2024-01