When BTreeMap is constructed from ordered set, tree node size is increasing linearly with each item added. Each time new key is added to tree node, its size changes and storage needs to find new place. So constructing BTreeMap from ordered set leads to large store fragmentation.
Setting flush interval is workaround as BTreeMap node is always updated in memory (write cache) and only final version of node is stored on disk. @param delay flush write cache every N miliseconds @return this builder
|
|