I'm using a variant of static search trees in my search engine index though in this scenario the main bottleneck is block reads from disk, but the thinking is relatively similar to cache lines.

Use case is to query hundreds of gigabytes of data in tens of milliseconds.

(Skiplists is also used by some search engines.)