CacheOblivious Planar Orthogonal Range Searching and Counting.pdfVIP

Cache-Oblivious Planar Orthogonal Range Searching and Counting Lars Arge Gerth Stølting Brodal Rolf Fagerberg Morten Laustsen BRICS BRICS Dept. of Mathematics and BRICS Dept. of Computer Science Dept. of Computer Science Computer Science Dept. of Computer Science University of Aarhus University of Aarhus University of Southern Denmark University of Aarhus IT Parken, Åbogade 34 IT Parken, Åbogade 34 5230 Odense M, Denmark IT Parken, Åbogade 34 8200 Århus N, Denmark 8200 Århus N, Denmark rolf@imada.sdu.dk 8200 Århus N, Denmark large@daimi.au.dk gerth@daimi.au.dk mol@daimi.au.dk ABSTRACT General Terms: Algorithms, Design We present the first cache-oblivious data structure for planar or- Keywords: Cache-Oblivious, orthogonal range searching, range thogonal range counting, and improve on previous results for cache- counting, semi-group range queries oblivious planar orthogonal range searching. Our range counting structure uses O(N log2 N ) space and an- 1 Introduction swers queries using O(logB N ) memory transfers, where B is the block size of any memory level in a multilevel memory hierar- The memory systems of modern computers are becoming increas- chy. Using bit manipula