Age-Partitioned Bloom Filters

Re:Age-Partitioned Bloom Filters by rolleiflex on Friday January 10, 2020 @01:19PM (#22013361)

Aether (https://getaether.net) also uses a roughly equivalent version of this I had thought, up to this point, that I ‘discovered’. I call it ‘Rolling Bloom’. (Not sure which implementation is first.)

Here’s the Go implementation: https://github.com/nehbit/aether/blob/master/aether-core/aet...

[ Parent | on HN ]

Re:Age-Partitioned Bloom Filters by CarlosBaquero on Friday January 10, 2020 @03:08PM (#22014874)

Thanks for the pointer. I took a look at the code and it’s different. Looks like Aether maintains several bloom filters, each link to a given time range. In contrast the paper builds a different kind of bloom filter where hash functions can overlap.

[ Parent | on HN ]

Re:Age-Partitioned Bloom Filters by rolleiflex on Friday January 10, 2020 @04:08PM (#22015553)

Interesting, thanks for taking a look. That is correct. Aether also does some partial merging in the cases where the time range required does not exactly match the filter sequence.

[ Parent | on HN ]