In disagg, cache management for the ingest table which is an in-memory btree becomes important. When reconciling an in-memory btree, we use the same eviction rules as the non in-memory btree. This is not efficient as we cannot overflow the updates to the history store. Instead of writing the stable version to the disk image and still keeping every version in memory on the update chain, we should write the oldest version that we still need to keep to the disk image and free it from the update chain.