7. Memory Hierarchy Models

MIT Advanced Data Structures, Spring 2012 View the complete course: Instructor: Erik Demaine Cache-efficient structures. B-trees are good at data transferred in blocks between cache and main memory, main memory and disk, and so on, achieving O(logB N) insert/delete/predecessor/successor for N items and memory block transfers of size B. License: Creative Commons BY-NC-SA More information at More courses at