New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

synchronization: consider using a deletable bloom filter? #9

Open

syjer opened this issue Oct 16, 2019 · 1 comment

Member

syjer commented Oct 16, 2019

Currently we are using a tree, but in theory, if it's compact enough, we could use a deletable bloom filter.

One of the biggest advantage is the fact that we can avoid to iterate over the keys during the table stats and sync process.

Obviously we need to check that the memory consumption of the structure is small enough.

Paper: http://arxiv.org/pdf/1005.0352.pdf

Member Author

syjer commented Oct 16, 2019

looks like we have something like 100kb of supporting structure, may be a little bit too much (?)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment