Improvement8.10-m03-int
Improve RESTORE REPLACE performance for new keys
Optimized RESTORE REPLACE command to use a single dictionary lookup instead of three when adding new keys, reducing overhead during dictionary rehashing operations.
For a new key, RESTORE REPLACE did three dict lookups (find, delete,
add). It now reuses the link from the first lookup for the insert and
skips the delete when no key is present, so it does a single lookup. The
impact is more visible while the dict is rehashing: three lookups would
trigger three incremental rehash steps instead of one. A similar
optimization could be applied to the non-REPLACE path, but RESTORE
REPLACE is the hotter path (e.g. atomic slot migration) and it would
require more changes.
performancerestorecommandsoptimization
Source: original entry ↗