Closed mtak- closed 5 years ago
Previously, when the bloom filter got too full (large transactions), reads and writes started hitting O(n^2) lookups, tanking performance.
Now on the first bloom filter failure, the bloom filter "rolls over" into an actual FxHashMap, which has more reasonable linear growth.
FxHashMap
Previously, when the bloom filter got too full (large transactions), reads and writes started hitting O(n^2) lookups, tanking performance.
Now on the first bloom filter failure, the bloom filter "rolls over" into an actual
FxHashMap
, which has more reasonable linear growth.