Grid-based Spatial Index Method for Location-based Nearest Neighbour Search
Abstract— Geo-spatial data becomes more and more large amount of data on the Web. On the other hand, managing massive spatial data is one of challenges for supporting spatial queries and high performance computational is also needed to support spatial queries. Thus there is needed to solve this criteria is to create a better spatial indexing method. The proposed method is to create Grid -based R-t ree index structure for k nearest neighbour query and range query. R-tree is constructed with Minimum Bounding Rectangle (MBR) that contains a group of objects. The proposed system is combined R-tree with grid index that is reduced overlapping and covering area. The proposed system is to support spatial queries efficiently and also supports speed up computational performance.
Index Terms— k Nearest Neighbor Search, R- tree, Grid-index,LBS
Aung Zaw Myint
University of Computer Studies, MYANMAR
Khin Mo Mo Tun
University of Information Technology, MYANMAR
Cite: Aung Zaw Myint, Khin Mo Mo Tun, "Grid-based Spatial Index Method for Location-based Nearest Neighbour Search," Proceedings of 2019 the 9th International Workshop on Computer Science and Engineering WCSE_2019_SPRING, pp. 178-183, Yangon, Myanmar, February 27-March 1, 2019.