Archived: disk-trie deep-dive chapters (superseded by libdictenstein)

Status: Archived — historical reference, not maintained.

The canonical, maintained disk-trie / PersistentARTrie theory now lives in the libdictenstein crate. For how the disk-persisted backends integrate with liblevenshtein, see the live pointer docs/theory/disk-tries/README.md. These chapters are preserved verbatim from before the 2026-07-12 documentation trim (they use the project's earlier notation and are not re-conformed):

1. 01-foundations — trie basics and disk-I/O fundamentals
2. 02-b-trie — B-trie architecture (Askitis & Zobel 2009)
3. 03-adaptive-radix-tree — Adaptive Radix Tree theory (Leis et al. 2013)
4. 04-persistent-art — disk persistence with pointer swizzling
5. 05-buffer-management — page cache, WAL, crash recovery
6. 06-persistent-artrie-design — the hybrid PART design
7. 07-benchmark-results — benchmark results

See ../README.md for the archival rationale.