Skip to main content
SpringerLink
Log in

Building and Querying a P2P Virtual World

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment. One peer is introduced to the system by each participant. However current P2P applications can only provide file sharing and other forms of relatively simple data communications, and, in this paper, we demonstrate how this limitation can be bridged by indexing and querying a 3D virtual-world on a dynamic distributed network. We present an algorithm for 3D range queries as well as an algorithm for nearest neighbor queries. We also show how to build such a complex application from the ground level of a P2P routing algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Aberer and M. Punceva. “Efficient search in structured peer-to-peer systems: Binary vs. k-ary unbalanced tree structures,” in Proceedings of the International Workshop on Databases, Information Systems, and Peer-to-Peer Computing (held in conjunction with VLDB), Berlin, Germany, September 2003.

  2. A. Aboulnaga and J.F. Naughton. “Accurate estimation of the cost of spatial selections,” in Proceedings of the IEEE International Conference on Data Engineering, pp. 123–134, San Diego, CA, February 2000.

  3. J. Aspnes and G. Shah. “Skip graphs,” in Proceedings of SODA, pp. 384–293, Baltimore, MD, January 2003.

  4. F. Banaei-Kashani and C. Shahabi. “SWAM: A family of access methods for similarity-search in peer-to-peer data networks,” in Proceedings of the Conference on Information and Knowledge Management-CIKM, pp. 304–313, Washington, DC, November 2004.

  5. M. Batko, C. Gennaro, P. Savino and P. Zezula. “Scalable similarity search in metric spaces,” in Proceedings of the DELOS Workshop on Digital Library Architectures: Peer-to-Peer, Grid, and Service-Orientation, pp. 213–224, Padova, Italy, June 2004.

  6. M. Batko, C. Gennaro and P. Zezula. “A scalable nearest neighbor search in P2P systems,” in Proceedings of the International Workshop on Databases, Information Systems, and Peer-to-Peer Computing (held in conjunction with VLDB), pp. 64–77, Toronto, Canada, August 2004.

  7. J.L. Bentley. “Multidimensional binary search trees used for associative searching,” Communications of the ACM, Vol. 18(9):509–517, September 1975.

    Article  Google Scholar 

  8. S. Bhattacharjee, P. Keleher and B. Silaghi. “The design of TerraDir,” Technical Report CS-TR-4299, Department of Computer Science, University of Maryland at College Park, October 2001.

  9. M. Demirbas and H. Ferhatosmanoglu. “Peer-to-peer spatial queries in sensor networks,” in Proceedings of the IEEE International Conference on Peer-to-Peer Computing, pp. 32–39, Linkoping, Sweden, September 2003.

  10. P. Druschel and A. Rowstron. “PAST: A large-scale, persistent peer-to-peer storage utility,” in Proceedings of the IEEE HotOS VIII Workshop, pp. 65–70, Schloss Elmau, Germany, May 2001.

  11. P. Ganesan, M. Bawa and H. Garcia-Molina. “Online balancing of range-partitioned data with applications to peer-to-peer systems,” in Proceedings of the International Conference on Very Large Databases-VLDB, pp. 444–455, Toronto, Canada, August 2004.

  12. P. Ganesan, B. Yang and H. Garcia-Molina. “One torus to rule them all: Multidimensional queries in P2P systems,” in Proceedings of the ACM SIGMOD'04, WebDB Workshop, pp. 19–24, Paris, France, June 2004.

  13. A. Guttman. “R-trees: A dynamic index structure for spatial searching,” in Proceedings of the ACM SIGMOD'84, pp. 47–57, Boston, MA, June 1984.

  14. A. Harwood, S. Karunasekera, S. Nutanong, E. Tanin and M. Truong. “Complex applications over peer-to-peer networks,” in Poster Proceedings of the ACM Middleware'04, p. 327, Toronto, Canada, October 2004.

  15. G.R. Hjaltason and H. Samet. “Index-driven similarity search in metric spaces,” ACM Transactions on Database Systems, Vol. 28(4):517–580, December 2003.

    Article  Google Scholar 

  16. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin and R. Panigraphy. “Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web,” in Proceedings of the ACM Symposium on Theory of Computing, pp. 654–663, El Paso, TX, May 1997.

  17. G. Kedem. “The quad-cif tree: A data structure for hierarchical on-line algorithms,” Technical Report TR-91, Department of Computer Science, University of Rochester, September 1981.

  18. W. Litwin and T. Risch. “LH*g: A high-availability scalable distributed data structure by record grouping,” IEEE Transactions on Knowledge and Data Engineering, Vol. 14(4):923–927, July 2002.

    Article  Google Scholar 

  19. A. Mondal, Yilifu and M. Kitsuregawa. “P2PR-tree: An R-tree-based spatial index for peer-to-peer environments,” in Proceedings of the International Workshop on Peer-to-Peer Computing and Databases (held in conjunction with EDBT), pp. 516–525, Heraklion-Crete, Greece, March 2004.

  20. C.G. Plaxton, R. Rajaraman and A.W. Richa. “Accessing nearby copies of replicated objects in a distributed environment,” Theory of Computing Systems, Vol. 32(3):241–280, May 1999.

    Article  Google Scholar 

  21. S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker. “A scalable content-addressable network,” in Proceedings of the ACM SIGCOMM'01, pp. 161–172, San Diego, CA, August 2001.

  22. N. Roussopoulos, S. Kelley and F. Vincent. “Nearest neighbor queries,” in Proceedings of the ACM SIGMOD'95, pp. 71–79, San Jose, CA, May 1995.

  23. A. Rowstron and P. Druschel. “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” in Proceedings of the ACM Middleware'01, pp. 329–350, Heidelberg, Germany, November 2001.

  24. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley: Reading, MA, 1990.

    Google Scholar 

  25. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley: Reading, MA, 1990.

    Google Scholar 

  26. H. Samet. “Depth-first k-nearest neighbor finding using the maxnearestdist estimator,” in Proceedings of the International Conference on Image Analysis and Processing, pp. 486–491, Mantova, Italy, September 2003.

  27. K. Sevcik and N. Koudas. “Filter trees for managing spatial data over a range of size granularities,” in Proceedings of the International Conference on Very Large Databases-VLDB, pp. 16–27, Mumbai, India, September 1996.

  28. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek and H. Balakrishnan. “Chord: A scalable peer-to-peer lookup service for Internet applications,” in Proceedings of the ACM SIGCOMM'01, pp. 149–160, San Diego, CA, August 2001.

  29. E. Tanin, A. Harwood and H. Samet. “A distributed quadtree index for peer-to-peer settings,” in Proceedings of the IEEE International Conference on Data Engineering, pp. 254–255, Tokyo, Japan, April 2005.

  30. E. Tanin, A. Harwood, H. Samet, S. Nutanong and M. Truong. “A serverless 3D world,” in Proceedings of the ACM Symposium on Advances in Geographic Information Systems, pp. 157–165, Arlington, VA, November 2004.

  31. B.Y. Zhao, J.D. Kubiatowicz and A.D. Joseph. “Tapestry: An infrastructure for fault-resilient wide-area location and routing,” Technical Report UCB-CSD-01-1141, Department of Computer Science, University of California, Berkeley, April 2001.

Download references

Author information

Authors and Affiliations

  1. NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, University of Melbourne, Australia

    Egemen Tanin, Aaron Harwood, Deepa Nayar & Sarana Nutanong

  2. Department of Computer Science, Center for Automation Research, Institute for Advanced Computer Studies, University of Maryland at College Park, USA

    Hanan Samet

Authors
  1. Egemen Tanin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aaron Harwood
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hanan Samet
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Deepa Nayar
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sarana Nutanong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Egemen Tanin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tanin, E., Harwood, A., Samet, H. et al. Building and Querying a P2P Virtual World. Geoinformatica 10, 91–116 (2006). https://doi.org/10.1007/s10707-005-4887-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-005-4887-8

Keywords

Search

Navigation