22 search results - page 1 / 5 » Dynamic Range Reporting in External Memory |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
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...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
PODS
2009
ACM
14 years 7 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...
FMICS
2009
Springer
14 years 1 months ago
2009
Springer
We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checki...