Summary: Cache­Oblivious Data Structures for
Orthogonal Range Searching
Pankaj K. Agarwal # Lars Arge + Andrew Danner # Bryan Holland­Minkley §
Department of Computer Science
Duke University
{pankaj,large,adanner,bhm}@cs.duke.edu
ABSTRACT
We develop cache­oblivious data structures for orthogonal
range searching, the problem of finding all T points in a set
of N points in R d lying in a query hyper­rectangle. Cache­
oblivious data structures are designed to be e#cient in ar­
bitrary memory hierarchies.
We describe a dynamic linear­size data structure that an­
swers d­dimensional queries in O((N/B) 1-1/d +T/B) mem­
ory transfers, where B is the block size of any two levels of
a multilevel memory hierarchy. A point can be inserted into
or deleted from this data structure in O(log 2
B N) memory
transfers. We also develop a static structure for the two­
dimensional case that answers queries in O(log B N + T/B)

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

Collections: Computer Technologies and Information Sciences