Open Access Open Access  Restricted Access Subscription or Fee Access

Storing and Indexing Spatial Data in P2P Systems

S. Imavathy, S. Mahalakshmi, R. Uma Maheswari, T. Vaishnavi, P. Vennila


In a Computer Network, the peer-to-peer (P2P) paradigm has become very popular for loading and distributing information in separate manner that is from one single system to another system. At first, theP2P systems are very useful in sharing the one dimensional information. But nowadays, the need for P2P applications with multidimensional data has risen, inspiring research on P2P systems that can handle such type of data. Now the point to focus is on structured P2P systems that share spatial information (partial) and also we have to found the area and directionality of the multidimensional information. We present SPATIALP2P, which is a totally and inherently distributed P2P network and also a totally separate indexing and searching framework that is suitable for spatial data. SPATIALP2P supports P2P applications in which spatial information of various sizes can be dynamically edited, updated, and peers can leave or join. SPATIALP2P 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. Finally, contrary to existing DHT-based approaches, SPATIALP2P captures the locality and directionality of the 2D space.


peer-to-peer,P2P applications,index structure

Full Text:



F. Banaei-Kashani and C. Shahabi, “SWAM: A Family of Access Methods for Similarity-Search in Peer-to-Peer Data Networks,” Proc. 13th ACM Int’l Conf. Information and Knowledge Management (CIKM ’04), pp. 304-313, 2004.

A. Bharambe, M. Agrawal, and S. Seshan, “MERCURY: Supporting Scalable Multi-Attribute Range Queries,” Proc. ACM SIGCOMM ’04, pp. 353-366, 2004.

M. Cai, M. Frank, J. Chen, and P. Szekely, “MAAN: A Multiattribute Addressable Network for Grid Information Services,” Proc. Fourth Int’l Workshop Grid Computing (GRID ’03), pp. 184-191,2003.

W. Cai, S. Zhou, L. Xu, W. Qian, and A. Zhou, “c2: A New Overlay Network Based on CAN and Chord,” Proc. Int’l Conf. Grid and Cooperative Computing (GCC ’03), pp. 42-50, 2003.

Multi-Dimensional Queries in P2P Systems,” Proc. Seventh Int’l Workshop Web and Databases (WebDB ’04), pp. 19-24, 2004.

A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD ’84, pp. 47-57, 1984.

H. Jagadish, B. Ooi, K.-L. Tan, Q. Vu, and R. Zhang, “Speeding Up Search in Peer-to-Peer Networks with a Multi-Way Tree Structure,” Proc. ACM SIGMOD ’06, pp. 1-12, 2006.

H. Jagadish, B. Ooi, and Q. Vu, “BATON: A Balanced Tree Structure for Peer-to-Peer Networks,” Proc. 31st Int’l Conf. Very Large Data Bases (VLDB ’05), pp. 661-672, 2005.

V. Kantere and T. Sellis, “Handling Spatial Data in Distributed Environments,” Proc. ACM 15th Int’l Symp. Advances in Geographic Information Systems (ACM-GIS ’07), pp. 11-18, 2007.

V. Kantere and T. Sellis, “A Study for the Parameters of a Distributed Framework That Handles Spatial Areas,” Proc. 10th Int’l Symp. Spatial and Temporal Databases (SSTD ’07), pp. 385-402, 2007.

A. Mondal, Yilifu, and M. Kitsuregawa, “P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments,” Proc. Second Int’l Workshop Databases, Information Systems, and Peer-to-Peer Computing (DBISP2P ’04), pp. 516-525, 2004.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.