Fig. 2
From: Comparison and evaluation of state-of-the-art LSM merge policies
a An eager, stable schedule \(\sigma \) (\(n=6\), \(k=3\)). b A graphical representation of \(\sigma \). Each shaded rectangle is an SSTable (over time). Row t is the stack at time t. c The binary-search-tree representation of \(\sigma \)