Research On Indexing Spatial Data In P2P System

With the rapid development of the Internet, people’s demands for network services have become higher and higher, investigators focus on the P2P paradigm and it becomes very popular. Until recently, research focused mainly on P2P systems that host one-dimensional data. With the increasing application of multidimensional data in P2P more and more widely, many researches that fuscous on multidimensional data appear. The majority of the proposed techniques are based either on the distribution of centralized indexes or on the reduction of multidimensional data to one dimension by using a space-filling curve. However, these methods violate the distributed characteristics or difficultly preserve the locality and directionality of spatial data.Based on the existing researches, this paper uses a grid to partition the space, defines an appropriate distance, distributes the spatial information to peers and guarantees the retrieval of any spatial area that exists in the system by a similar one-dimensional distributed hash table method, and it can also preserve the multidimensional attribution.KJ-P2P system is suitable for spatial data, it can preserves well locality and directionality of space, supports P2P applications in which spatial information of various sizes can be dynamically inserted or deleted, and peers can join or leave, efficiently handles changes in the spatial information and in the network structure caused by joining or leaving peers without the need of load balancing or restructuring. And it has the advantages of low Time complexity and low space complexity. It is really a more efficient and stable system for storing and indexing spatial data. Through the simulation experiment, it shows that the KJ-P2P system has better comprehensive performance than widely used z-Chord method.