O'Reilly logo

Handbook of Data Structures and Applications, 2nd Edition by Sartaj Sahni, Dinesh P. Mehta

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

35

Cache-Oblivious Data Structures*

Lars Arge

University of Aarhus

Gerth Stølting Brodal

University of Aarhus

Rolf Fagerberg

University of Southern Denmark

35.1The Cache-Oblivious Model

35.2Fundamental Primitives

Van Emde Boas Layoutk-Merger

35.3Dynamic B-Trees

Density BasedExponential Tree Based

35.4Priority Queues

Merge Based Priority Queue: Funnel HeapExponential Level Based Priority Queue

35.52d Orthogonal Range Searching

Cache-Oblivious kd-TreeCache-Oblivious Range Tree

Acknowledgments

References

35.1The Cache-Oblivious Model

The memory system of most modern computers consists of a hierarchy of memory levels, with each level acting as a cache for the next; for a typical desktop computer the hierarchy consists of registers, level 1 cache, ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required