Skip to main content

P2P Spatial Query Processing by Delaunay Triangulation

  • Conference paper
Book cover Web and Wireless Geographical Information Systems (W2GIS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3428))

Abstract

Although a number of methods have been proposed to process exact match or range queries in P2P network, very few attention has been paid on spatial query process. In this paper, we propose a triangular topology of P2P network and spatial query processing methods on this topology. Each node maintains a set of pointers to neighbor nodes determined by delaunay triangulation. This triangular network topology provides us with an efficient way to find a path from any source node to the destination node or area, and to process spatial queries. We compare two spatial query processing methods based on the triangular network by experiments.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Banaei-Kashani, F., Shahabi, C.: Searchable querical data networks. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 17–32. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Handley, M., Karp, R., Ratnasamy, S., Francis, P., Schenker, S.: A scalable content-addressable network. In: ACM SIGCOMM Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications, pp. 161–172 (2001)

    Google Scholar 

  3. Karger, D., Frans Kaashoek, M., Stoica, I., Morris, R., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM Proceedings of the conference on Applications, technologies architectures, and protocols for computer communications, pp. 149–160 (2001)

    Google Scholar 

  4. Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: Proceedings of the Conference on Peer-to-Peer Computing, p. 33 (2002)

    Google Scholar 

  5. Cai, J., Cai., M., Frank, M., Szekely, P.: Maan: A multi-attribute addressable network for grid information services. In: Proceedings of Grid Computing, p. 184 (2003)

    Google Scholar 

  6. Gnutella, http://gnutella.wego.com/

  7. Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Kubiatowicz, J.D., Zhao, B.Y., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report, University of California, Berkeley (2001)

    Google Scholar 

  9. King, C.-T., Hsiao, H.-C.: Bristle: A mobile structured peer-to-peer architecture. In: Proceedings of Symposium on Parallel and Distributed Processing, p. 33.1 (2003)

    Google Scholar 

  10. An, X., Daskos, A., Ghandeharizadeh, S.: Peper: A distributed range addressing space for peer-to-peer systems. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 200–218. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Araujo, F., Rodrigues, L.: Geopeer: A location-aware peer-to-peer system. DI/FCUL TR 03–31, Department of Informatics, University of Lisbon (December 2003)

    Google Scholar 

  12. Nahas, M., Liebeherr, J., Si, W.: Application-layer multicasting with delaunay triangulation overlays. UVa/CS TR 01–26, Department of Computer Science, University of Virginia (December 2001)

    Google Scholar 

  13. Ko, Y., Vaidya, N.H.: Location-aided routing (lar) in mobile ad hoc networks. In: Proceedings of Mobile computing and networking, pp. 66–75 (1998)

    Google Scholar 

  14. Karp, B., Kung, H.T.: Gpsr: Greedy perimeter stateless routing for wireless networks. In: Proceedings of Mobile computing and networking, pp. 243–254 (2000)

    Google Scholar 

  15. Xu, Y., Lee, W.-C.: Window query processing in highly dynamic sensor networks: Issues and solutions. In: Proceedings of GeoSensor Networks (2003)

    Google Scholar 

  16. Preparata, F.P., lan Shamos, M.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kang, HY., Lim, BJ., Li, KJ. (2005). P2P Spatial Query Processing by Delaunay Triangulation. In: Kwon, YJ., Bouju, A., Claramunt, C. (eds) Web and Wireless Geographical Information Systems. W2GIS 2004. Lecture Notes in Computer Science, vol 3428. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427865_11

Download citation

  • DOI: https://doi.org/10.1007/11427865_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26004-2

  • Online ISBN: 978-3-540-31964-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics