Cache-Oblivious R-Trees


We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point can be found efficiently. Our structure is an axis-aligned bounding-box hierarchy and as such it is the first cache-oblivious R-tree with provable performance guarantees. If no point… (More)
DOI: 10.1007/s00453-007-9007-8


5 Figures and Tables

Slides referencing similar topics