Part 7 · Numeric & Spatial SearchChapter 22
BKD Trees
The same partitioning, but leaves hold blocks of byte-encoded points instead of one object each.
The question
How does this work when the points live on disk?
The structure responsible
BKD tree with leaf blocks
In this lab: Change the leaf size and compare blocks read, points compared and bytes touched.
building the index…