I am fascinated by the bloom filter data structure. Is there a similar probabilistic data structure that can efficiently store and update the relationships between certain elements and the strength of those relationships?

  • 1
    $\begingroup$ If the "strength" is an integer, there is an extension of Bloom filters from sets to multisets, known as the Spectral Bloom filter. cs.princeton.edu/courses/archive/spring05/cos598E/bib/… $\endgroup$
    – Pseudonym
    Feb 13, 2022 at 3:55
  • 1
    $\begingroup$ What do you mean by the relationships between certain elements? Can you be more specific? Can you list the operations you want to be able to perform on such a datastructure, or the operations you want it to support? $\endgroup$
    – D.W.
    Feb 14, 2022 at 2:33


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.