Overview of Relaxed Radix Balanced Trees, a data structure that allows for efficient merging of Persistent Vectors.

An introduction to bitmaps, what they’re used for, and what Roaring bitmaps solve that traditional bitmaps don’t.

High-level introduction to B-trees and why they are practical when implementing databases.

Introduction to Ternary Search Tries

Notes on the following algorithms and methods:

• Levenshtein distance
• Damerau-Levenshtein distance
• Bitap algorithm with modifications by Wu and Manber
• Spell-checker method
• N-gram method
• Signature hashing method
• BK-trees