921 search results - page 8 / 185 » New Data Structures for Orthogonal Range Searching |
144
Voted
SIBGRAPI
2008
IEEE
15 years 10 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
156
Voted
ISAAC
2007
Springer
15 years 10 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 ...
131
Voted
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
147
Voted
INFOSCALE
2007
ACM
15 years 5 months ago
2007
ACM
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
147
Voted
BERTINORO
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we present and evaluate uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHT-based peer-to-peer systems. We compare our ap...