Distributed Processing of Range Queries with Non-Spatial Selections

In this paper, we focus on the problem of processing spatial range queries with non-spatial selections. In order to process range queries with non-spatial selections, we first introduce a baseline search algorithm. Then, we propose a novel search algorithm on the Hilbert R-tree to reduce the number of data accesses. Both the baseline algorithm and the proposed algorithm utilize MapReduce because traditional single machine-based query processing methods might suffer from drastic performance degradation when the size of the dataset becomes extremely large. Through simulations, we compare the performances of the baseline algorithm and the proposed algorithm, and verify the efficiency of our proposed algorithm.