Efficient Batch Processing of Proximity Queries with MapReduce

This paper addresses the problem of efficient processing a large set of proximity monitoring queries. Many location-based applications are enabled by handling many moving queries over mobile objects. Efficient processing of such queries mainly relies on effective probing because it needs a huge amount of distance-based comparison. To reduce processing time, we propose a new search algorithm that utilizes MapReduce. We introduce a concept of processing categorization and the MapReduce-based query processing algorithm. Through simulations, we demonstrate the efficiency of the proposed method for a wide range of location-based applications.