External-memory dictionaries with worst-case update cost
The $ B^{\epsilon} $-tree [Brodal and Fagerberg 2003] is a simple I/O-efficient external-
memory-model data structure that supports updates orders of magnitude faster than B-tree …
memory-model data structure that supports updates orders of magnitude faster than B-tree …