part 07 · Numeric & Spatial Search

22 · BKD Trees

The same partitioning, but leaves hold blocks of byte-encoded points instead of one object each.

How does this work when the points live on disk? Answered by BKD tree with leaf blocks.

In this lab: Change the leaf size and compare blocks read, points compared and bytes touched.

loading mind map…
building the index…