Skip to content
This repository has been archived by the owner on Dec 13, 2022. It is now read-only.

chore(mailmap): Add Ahsan to mailmap #4

Merged
merged 1 commit into from
Feb 19, 2022
Merged

chore(mailmap): Add Ahsan to mailmap #4

merged 1 commit into from
Feb 19, 2022

Conversation

ahsanbarkati
Copy link
Contributor

@ahsanbarkati ahsanbarkati commented Feb 13, 2022

Add mailmap [email protected] -> [email protected]


This change is Reviewable

Copy link
Contributor

@manishrjain manishrjain left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

:lgtm:

Reviewed 1 of 1 files at r1, all commit messages.
Reviewable status: :shipit: complete! all files reviewed, all discussions resolved (waiting on @ahsanbarkati)

@ahsanbarkati ahsanbarkati merged commit 606caa5 into main Feb 19, 2022
@ahsanbarkati ahsanbarkati deleted the ahsan/mailmap branch February 19, 2022 09:03
manishrjain added a commit that referenced this pull request Jul 6, 2022
fix(bloom): BloomBitsPerKey does not depend on number of keys

During the bits per key (m/n) calculation we first multiply the result by `numEntries` to get the size of the bloom filter (m), and then divide by `numEntries` to get the m/n.  Also for some reason, as was mentioned in #1763, current implementation underestimates the result by 30% because of erroneous multiplication by `Ln2`.

Wikipedia suggests that bits per key calculation can be simplified to:
<img src="https://render.githubusercontent.com/render/math?math=\frac{m}{n}=-\frac{\log_2\varepsilon}{\ln 2}\approx-1.44\log_2\varepsilon">

While here also fix edgecases for very small and large ε to protect against misuse and added tests.

This is a copy of: dgraph-io/badger#1773
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants