ConceptSystems & CS
Bulk insert
Building a new B+Tree from the bottom up by first pre-sorting keys and laying them out as leaf nodes with sibling pointers.
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
4The lectures that define it or assume it, and the concepts next to it.