Niels Lohmann 331615d3de Bound the probe length of the large-object hash index ...

The key hash is not seeded, so keys chosen to collide made building the table quadratic (20,000 colliding keys took 470 ms to parse). A key may now sit at most 64 slots from its home slot; if a key would sit further away, the table is dropped and the object is searched linearly. Lookups stop after the same distance.

Signed-off-by: Niels Lohmann <mail@nlohmann.me>

2026-10-09 16:11:25 +02:00

..

nlohmann

Bound the probe length of the large-object hash index

2026-10-09 16:11:25 +02:00