Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Cache-Oblivious Data Structures for Orthogonal Range Searching
 

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 Ęd
lying in a query hyper-rectangle. Cache-
oblivious data structures are designed to be efficient 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

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet
Danner, Andrew - Computer Science Department, Swarthmore College

 

Collections: Computer Technologies and Information Sciences