19 search results - page 1 / 4 » Approximate Range Searching in External Memory |
97
Voted
ISAAC
2007
Springer
15 years 3 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 ...
ICALP
1999
Springer
15 years 1 months ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
ESA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...