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 ℝ
d
and can report all points inside a query range Q by accessing O(log
B
N+ϵ
γ
+k
ϵ
/B) disk blocks, where B is the disk block size, γ=1 − d for convex queries and γ=−d otherwise, and k
ϵ
is the number of points lying within a distance of ϵ·diam(Q) to the query range Q. Our second structure, the object‐BAR‐B‐tree, is able to store objects of arbitrary shapes of constant complexity and provides similar query guarantees. In addition, both structures can support other types of range searching queries such as range aggregation and nearest‐neighbor. Finally, we present I/O‐efficient algorithms to build these structures.
