Efficient Scheduling of Root-to-Leaf Operations in Write-Optimized Trees

This paper proposes an efficient algorithm to schedule root-to-leaf operations, such as deferred queries and secure deletes, in write-optimized data structures like Bε-trees, in order to minimize the average completion time of these operations.