Finding Nearest Location with Open Box Query using Geohashing and MapReduce

Abstract

Geospatial queries play an important role in modern day life both for common man as well as industries. Due to advancement in location based industries this need has grown even more. Geospatial query can be of various types. In this thesis geospatial query to find the nearest location is presented. Geohashing will be used to come out with the solution. Geohashing is a technique which converts the longitude, latitude pair into a single value. Usage of the geohashing will make it very efficient to find the location. There comes various situation when one want to know the any nearest location around him in which he/she is interested due to any reason. Geospatial query uses Geospatial data. But the size of this data is too big. So it is inefficient to process this much big data using sequential methods. Therefore some parallel processing technique is required to make it more efficient in various manners. MapReduce is a framework that is used for parallel implementation. MapReduce splits the input into the independent chunks and execute them in parallel over different mappers. When using MapReduce, developer need not to worry about other factors like fault tolerance, load balancing etc. all these factors are handled by MapReduce. He can only concentrate more on his programming. Without MapReduce it would not be efficient to process so much big spatial data. Spatial data may contain the knowledge about lot of locations. So it is very important to efficiently process it. MapReduce has been used in various fields before but never has been used in finding the nearest location. Geohashing and MapReduce when fused together would give very good results.