Exponential Structures for Efficient Cache-Oblivious Algorithms

Michael A. Bender, Richard Cole, Rajeev Raman

Abstract: We present cache-oblivious data structures based upon exponential structures. These data structures perform well on a hierarchical memory but do not depend on any parameters of the hierarchy, including the block sizes and number of blocks at each level. The problems we consider are searching, partial persistence and planar point location. On a hierarchical memory where data is transferred in blocks of size B, some of the results we achieve are: