Update Efficient Data Structures
In this post we want to take a closer look at data structures designed for low update overhead that are commonly used in practice, i.e. logs and journals, log-structured merge-trees, as well as B trees and some B tree extensions. This blog post is the third part of the RUM series.
Tags: scala, learning, database, computerscience