B+-trees: why an index lookup takes four reads

How a B+-tree index stays shallow: fanout from big disk pages gives log-base-500 height, leaf splits keep it balanced, linked leaves serve range scans.

Part of Indexes.

Read first

Read next