Algorithms

To investigate

Levenshtein automaton.
Forward decay.
t-digest.
HdrHistogram.

Databases: LSMTree (Log-Structured Merge-Tree), SSTable.

The most widely used indexing structure: B-tree.
B-trees break the database into down into fixed-size blocks or pages.