Cache-oblivious iterated predecessor queries via range coalescing

Abstract

In this paper we develop an optimal cache-oblivious data structure that solves the iterated predecessor problem. Given k static sorted lists L1, L2,..., Lk of average length n and a query value q, the iterated predecessor problem is to find the largest element in each list which is less than q. Our solution to this problem, called “range coalescing”, requires O(logB+1 n + k/B) memory transfers for a query on a cache of block size B, which is information-theoretically optimal. The range-coalescing data structure consumes O(kn) space, and preprocessing requires only O(kn/B) memory transfers with high probability, given a tall cache of size M = Ω(B2).