Not sure exactly what OP is referring to, but CSS-trees [1] are a classic example of cache-aware indexing structures that fetch entire pages into cache and arrange data so that most of the comparisons happen on cached data. In most cases, they significantly outperform binary trees. Masstree [2] is a more recent example of this.<p>[1] <a href="http:&#x2F;&#x2F;www.vldb.org&#x2F;conf&#x2F;1999&#x2F;P7.pdf" rel="nofollow">http:&#x2F;&#x2F;www.vldb.org&#x2F;conf&#x2F;1999&#x2F;P7.pdf</a><p>[2] <a href="https:&#x2F;&#x2F;pdos.csail.mit.edu&#x2F;papers&#x2F;masstree:eurosys12.pdf" rel="nofollow">https:&#x2F;&#x2F;pdos.csail.mit.edu&#x2F;papers&#x2F;masstree:eurosys12.pdf</a>