ABSTRACT is chapter brings together three topics: hash functions, Bloom lters, and the recently emerged streaming algorithms. Hashing is the oldest of the three and is backed by much literature. Bloom lters are based on hash functions and benet from hashing eciency directly. Streaming algorithms use both Bloom lters and hashing in various ways but impose strict requirements on performance. is chapter views the three topics from the viewpoint of eciency and speed. e two main performance metrics are per-unit processing time and the size of the memory footprint. All algorithms are presented as C/C++ pseudocode. Specic attention is paid to the feasibility of hardware implementation.