Sciweavers

33 search results - page 1 / 7
» On dynamic range reporting in one dimension
Sort
View
STOC
2005
ACM
94views Algorithms» more  STOC 2005»
14 years 5 months ago
On dynamic range reporting in one dimension
Christian Worm Mortensen, Rasmus Pagh, Mihai Patra...
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
14 years 5 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 3 months ago
Dynamic Range Reporting in External Memory
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(log2 B N + k B ) I/O operations, where k is the nu...
Yakov Nekrich
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 5 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
COMPGEOM
2009
ACM
13 years 11 months ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh