The Cost of Cache-Oblivious Searching

This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than lg e logB N memory transfers between any two levels of the memory hierarchy. This lower bound holds even if all of the block sizes are limited to be powers of 2. The paper gives modified versions of the van Emde Boas layout, where the expected number of memory transfers between any two levels of the memory hierarchy is arbitrarily

• Type: Conference
• Year: 2003
• Where: FOCS
• Authors: Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz
• Keywords: Cache-oblivious Search Structure, FOCS 2003, Memory Hierarchy, Memory Transfers, Theoretical Computer Science