3 ms·
is there an implementation of B+ trees that fluidly pulls from disk vs RAM? e.g., two B+ trees, one in RAM and one on disk, with the RAM one evicted with sieve
by pluto_modadic 1y ago
is there an implementation of B+ trees that fluidly pulls from disk vs RAM?
e.g., two B+ trees, one in RAM and one on disk, with the RAM one evicted with sieve caching? possibly a very lite WAL?
something that lets you use a B+ tree bigger than RAM, and persist to disk
- aidenn0 1y agoThat's a type of Log-structured merge-tree.
- gxt 1y agoYou can implement a BTree with nodes stored in file-backed memmaps. It's plenty fast for the usual business case.
- yencabulator 1y agoPretty much every OLTP database contains an implementation of that. https://www.youtube.com/playlist?list=PLSE8ODhjZXjYMAgsGH-GtY5rJYZ6zjsd5 https://www.youtube.com/playlist?list=PLSE8ODhjZXjYMAgsGH-Gt...