A geohash-based index for spatial data management in distributed memory

In Geographical Information System (GIS) fields, the performance of data access is critical for the whole performance of applications. But spatial data access becomes the performance bottleneck of high-tech research and development in GIS. In this study, features are mapped into a distributed memory through distributed hash functions. Then, the Geohash method is adopted to build a distributed spatial index for the distributed memory. At the end of this article, a contrast experiment is carried out between our method and a traditional spatial database. The results show that for complex data operation, our method is dozens faster. To sum it up, through the key technology above, the reading and writing performance of spatial data makes a great progress, which provides a solid technical foundation for high performance geographical computation.

[1]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[2]  Hanan Samet,et al.  Data-Parallel Spatial Join Algorithms , 1994, 1994 International Conference on Parallel Processing Vol. 3.

[3]  Bill Nitzberg,et al.  Distributed shared memory: a survey of issues and algorithms , 1991, Computer.