Record cache improvements

mitdbg / treeline

An update-in-place key-value store for modern storage.

MIT License

132 stars 18 forks source link

Closed mmarkakis closed 2 years ago

mmarkakis commented 2 years ago

This PR adds 2 features to the record cache:

When evicting, if the candidate record is dirty, we scan through the cache once more in the hopes of finding a non-dirty one.
A scan function with both a lower and an upper bound