Range search in parallel using distributed data structures

doi:10.1016/0743-7315(92)90059-V

Journal of Parallel and Distributed Computing

Volume 15, Issue 1, May 1992, Pages 70-74

https://doi.org/10.1016/0743-7315(92)90059-V Get rights and content

Abstract

We present a parallel algorithm to obtain a set of points in a rectangular parallelpiped (range-search) in O(log n) time, with only (2 log²n − 10 log n + 14) processors on a EREW-PRAM, where processors are allowed to communicate through messages. We also present a nontrivial implementation technique on the hypercube parallel architecture with which the above time and processor bounds can be achieved without any communication overhead. A parallel algorithm for range searching is developed here using the concept of distributed data structures. We use the range tree proposed by Bentley as our data structure to be distributed. Range search has important applications in the areas of databases and computational geometry.

References (6)

J.L. Bentley et al.
Efficient worst-case data structures for range searching
Acta Inform.
(1980)
M.Y. Chan
Dilation-2 embeddings of grids into hypercubes
R.G. Karlsson et al.
Normalized divide-and-conquer: A scaling technique for solving multi-dimensional problems
In Form. Process. Lett.
(1987/1988)

There are more references available in the full text version of this article.

Cited by (4)

Efficient, parallel at-scale correlation analysis for atom probe tomography on hybrid architectures
2018, Proceedings - 2018 IEEE 32nd International Parallel and Distributed Processing Symposium, IPDPS 2018
Orthogonal range search using a distributed computing model
2011, Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, CCCG 2011
d-Dimensional Range Search on Multicomputers
1999, Algorithmica (New York)
Efficient parallel algorithms for geometric partitioning problems through parallel range searching
1994, Proceedings of the International Conference on Parallel Processing

^☆: A preliminary version of the paper was presented in the PARBASE-90 conference held in Miami, Florida.

^†: Current address: School of Electrical Engineering and Computer Science, University of Oklahoma, Norman, Oklahoma 73019.

View full text

Research noteRange search in parallel using distributed data structures☆

Abstract

Efficient worst-case data structures for range searching

Acta Inform.

Dilation-2 embeddings of grids into hypercubes

Normalized divide-and-conquer: A scaling technique for solving multi-dimensional problems

In Form. Process. Lett.

Research note
Range search in parallel using distributed data structures☆