Bloom filters

E1793839 UNEXPLORED

Bloom filters are space-efficient probabilistic data structures used to test whether an element is a member of a set, allowing for false positives but no false negatives.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Bloom filters canonical	2

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

HFiles → supports → Bloom filters ⓘ

Log-Structured Merge-Tree → mitigatedBy → Bloom filters ⓘ