[Bro] define a variable name based on string in bro

[william de ping]

So testing if an element was seen before using a bloom filter has the same
complexity as checking if its in a table ?

Thanks
B

On Tue, Apr 18, 2017 at 2:36 PM, Jan Grashöfer <jan.grashoefer at gmail.com>
wrote:

> > I wonder if O(1) is the case for reading from a table as well ?
> > If so, what would be the benefit of using a bloom filter ?
>
> Roughly said: You cannot store the actual data in a bloom filter. It is
> a probabilistic data structure for membership testing only. Compared to
> hash tables, bloom filters are very small and constant in space.
>
> Jan
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.ICSI.Berkeley.EDU/pipermail/bro/attachments/20170418/8f48a017/attachment.html