Algorithms and Data Structures for External Memory

11.4 Buffer Trees 97
between update and search for comparison-based EM dictionaries.
Matching upper bounds for several cases can be achieved with a truncated
version of the buffer tree.
In Section 12.2, we report on some timing experiments involving
buffer trees for use in bulk loading of R-trees. Further experiments on
buffer trees appear in [200].