Daniel Roberson
  • Posts
  • About
  • Notes
  • Projects
  • Time
  • Posts
    About
    Notes
    Projects
    Time

bloom filter

0001-01-01

A Bloom filter is a space-efficient probabilistic data structure created by Burton Howard Bloom in 1970. Bloom filters are used to test whether an element is a member of a set. False positives are possible, but false negatives are not. In plain words, querying a bloom filter will let you know if an element is likely in a set or definitely not in a set.

https://en.wikipedia.org/wiki/Bloom_filter


Links to this note

  • Main Index
  • linuxplus-breshahan2015
  • bloom filters and spell checking
  • Main Index - B
  • million dollar dream

Recent Posts

Linux Persistence: Modular Software

2025-04-17 DFIR CTF persistence linux persistence apache asterisk

Linux Persistence: Web Shells

2025-04-16 DFIR persistence webshell linux persistence webshell apache nginx PHP

Linux Persistence: Rootkits

2025-04-15 DFIR persistence rootkit LKM linux persistence LKM rootkit LD_PRELOAD kprobe ftrace ld.so hooking

Linux Persistence: Processes

2025-04-11 DFIR persistence processes linux persistence processes

Defanging Linux LKM Rootkits With cleanup_module()

2025-04-05 Linux LKM rootkits EDR hooks incident response Linux LKM rootkit


Home

About

Notes

Projects

Time

© All rights reserved. Powered by Hugo and Erblog.