This starts freeing empty tree nodes to allow their memory to be reclaimed and fixes a number of race conditions related to the previous way that dirty pages were being tracked. A separate PR will add reclamation for the heap-based on-disk storage system.
This starts freeing empty tree nodes to allow their memory to be reclaimed and fixes a number of race conditions related to the previous way that dirty pages were being tracked. A separate PR will add reclamation for the heap-based on-disk storage system.