ConceptSystems & CS
Be-tree
A write-optimized B-tree variant that stores changes to key/value entries in log buffers at inner nodes instead of immediately applying updates.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.