This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Storing and Indexing Spatial Data in P2P Systems
February 2009 (vol. 21 no. 2)
pp. 287-300
Verena Kantere, National Technical University of Athens, Zografou
Spiros Skiadopoulos, University of Peloponnese, Tripoli
Timos Sellis, National Technical University of Athens, Zografou
The peer-to-peer (P2P) paradigm has become very popular for storing and sharing information in a totally decentralized manner. At first, research focused on P2P systems that host 1D data. Nowadays, the need for P2P applications with multidimensional data has emerged, motivating research on P2P systems that manage such data. 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. Our goal is to create from scratch a technique that is inherently distributed and also maintains the multidimensionality of data. Our focus is on structured P2P systems that share spatial information. We present SpatialP2P, a totally decentralized indexing and searching framework that is suitable for spatial data. SpatialP2P supports P2P applications in which spatial information of various sizes can be dynamically inserted or deleted, and peers can join or leave. The proposed technique preserves well locality and directionality of space.

[1] 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.
[2] A. Bharambe, M. Agrawal, and S. Seshan, “MERCURY: Supporting Scalable Multi-Attribute Range Queries,” Proc. ACM SIGCOMM '04, pp. 353-366, 2004.
[3] 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.
[4] W. Cai, S. Zhou, L. Xu, W. Qian, and A. Zhou, “$c^{2}$ : A New Overlay Network Based on CAN and Chord,” Proc. Int'l Conf. Grid and Cooperative Computing (GCC '03), pp. 42-50, 2003.
[5] M. Demirbas and H. Ferhatosmanoglu, “Peer-to-Peer Spatial Queries in Sensor Networks,” Proc. Third Int'l Conf. Peer-to-Peer Computing (P2P '03), pp. 32-39, 2003.
[6] P. Druschel and A. Rowstron, “PASTRY: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. 18th IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), pp. 329-350, 2001.
[7] P. Ganesan, B. Yang, and H. Garcia-Molina, “One Torus to Rule Them All: Multi-Dimensional Queries in P2P Systems,” Proc. Seventh Int'l Workshop Web and Databases (WebDB '04), pp. 19-24, 2004.
[8] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD '84, pp. 47-57, 1984.
[9] 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.
[10] 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.
[11] H. Jagadish, B. Ooi, Q. Vu, R. Zhang, and A. Zhou, “VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes,” Proc. 21st Int'l Conf. Data Eng. (ICDE '05), pp. 34-45, 2005.
[12] V. Kantere, “Query Management in P2P Overlays,” PhD dissertation,School of Electrical and Computer Eng., www.dblab. ece.ntua.gr/~vkante/filesPhD2007.pdf , 2007.
[13] 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.
[14] 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.
[15] J. Lee, H. Lee, S. Kang, S. Choe, and J. Song, “CISS: An Efficient Object Clustering Framework for DHT-Based Peer-to-Peer Applications,” Proc. Second Int'l Workshop Databases, Information Systems, and Peer-to-Peer Computing (DBISP2P '04), pp. 215-229, 2004.
[16] Y. Manolopoulos, A. Nanopoulos, A. Papadopoulos, and Y. Theodoridis, R-Trees: Theory and Applications, series Advanced Information and Knowledge Processing, Springer, 2005.
[17] P. Maymounkov and D. Mazieres, “KADEMLIA: A Peer-to-Peer Information System Based on the XOR Metric,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), pp. 53-65, 2002.
[18] 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.
[19] G.M. Morton, “A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing,” technical report, IBM, 1996.
[20] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content Addressable Network,” Proc. ACM SIGCOMM '01, pp. 161-172, 2001.
[21] P. Rigaux, M. Scholl, and A. Voisard, Spatial Data Bases. MorganKaufman, 2001.
[22] O. Sahin, S. Antony, D. Agrawal, and A.E. Abbadi, “PRoBe: Multi-Dimensional Range Queries in P2P Networks,” Proc. Fourth ACM Workshop Wireless Security (WiSe '05), pp. 332-346, 2005.
[23] C. Schmidt and M. Parashar, “Flexible Information Discovery in Decentralized Distributed Systems,” Proc. High Performance Distributed Computing (HPDC '03), pp. 226-235, 2003.
[24] Y. Shu, B. Ooi, K.-L. Tan, and A. Zhou, “Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems,” Proc. Peer-to-Peer Computing (P2P '05), pp. 173-180, 2005.
[25] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “CHORD: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM '01, pp. 149-160, 2001.
[26] C. Tang, Z. Xu, and S. Dwarkadas, “Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks,” Proc. ACM SIGCOMM '03, pp. 175-186, 2003.
[27] E. Tanin, A. Harwood, and H. Samet, “Using a Distributed Quadtree Index in Peer-to-Peer Networks,” The VLDB J., vol. 16, no. 2, pp. 509-517, 2007.
[28] C. Zhang, A. Krishnamurthy, and R.Y. Wang, “Skipindex: Towards a Scalable Peer-to-Peer Index Service for High Dimensional Data,” Technical Report TR-703-04, 2004.
[29] B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, 2003.

Index Terms:
Peer-to-peer, structured overlays, distributed hash tables, spatial data.
Citation:
Verena Kantere, Spiros Skiadopoulos, Timos Sellis, "Storing and Indexing Spatial Data in P2P Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 2, pp. 287-300, Feb. 2009, doi:10.1109/TKDE.2008.139
Usage of this product signifies your acceptance of the Terms of Use.