@online{huang2025bloom,
  author       = {Huang, Xuanqiang Angelo},
  title        = {Bloom Filters},
  date         = {2025-01-28},
  organization = {Xuanqiang Angelo Huang's Blog},
  url          = {https://flecart.github.io/notes/bloom-filters/},
  langid       = {english},
  abstract     = {How Bloom Filters Work \# A Bloom filter is a space-efficient probabilistic data structure used to test whether an element is possibly in a set or definitely not in a set . It allows for false positives but never false negatives. One example of application is the membership query}
}
