Cache-Oblivious Planar Orthogonal Range Searching and Counting (2005)
Cached
Download Links
- [www.daimi.au.dk]
- [www.cs.au.dk]
- [www.daimi.au.dk]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. ACM Symposium on Computational Geometry |
| Citations: | 13 - 4 self |
BibTeX
@INPROCEEDINGS{Arge05cache-obliviousplanar,
author = {Lars Arge and Gerth Stølting Brodal and Morten Laustsen and Rolf Fagerberg},
title = {Cache-Oblivious Planar Orthogonal Range Searching and Counting},
booktitle = {In Proc. ACM Symposium on Computational Geometry},
year = {2005},
pages = {160--169}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present the first cache-oblivious data structure for planar orthogonal range counting, and improve on previous results for cache-oblivious planar orthogonal range searching. Our range counting structure uses O(N log2 N) space and answers queries using O(logB N) memory transfers, where B is the block size of any memory level in a multilevel memory hierarchy. Using bit manipulation techniques, the space can be further reduced to O(N). The structure can also be modified to support more general semigroup range sum queries in O(logB N) memory transfers, using O(N log2 N) space for three-sided queries and O(N log 2 2 N / log2 log2 N)
