[ ] When we reach a certain number of remaining keys (in the redo set)
For example, when there are only a few keys left to place, it might be worth growing the bit vector by a larger gamma factor to try to fit the remaining keys on the next level rather than storing 8 keys in the lowest 3-4 levels (each requiring 64 bits). The rationale is to reduce the number of levels by trying to place more keys on the "current" level (since the bit vector can hopefully avoid collisions that will require another level).
This would need to be benchmarked, both in terms of bits per key, number of levels, and creation and lookup performance.
We could possibly use the b.ReportMetrics to report bits per key and the number of levels.
We could increase gamma
redoset)For example, when there are only a few keys left to place, it might be worth growing the bit vector by a larger gamma factor to try to fit the remaining keys on the next level rather than storing 8 keys in the lowest 3-4 levels (each requiring 64 bits). The rationale is to reduce the number of levels by trying to place more keys on the "current" level (since the bit vector can hopefully avoid collisions that will require another level).
This would need to be benchmarked, both in terms of bits per key, number of levels, and creation and lookup performance.
We could possibly use the
b.ReportMetricsto report bits per key and the number of levels.