Skip to main content

Voronoi Diagrams for Query Processing

  • Reference work entry
  • First Online:
Encyclopedia of GIS

Synonyms

Network voronoi; Voronoi-based query processing in road network databases

Definition

Query processing in Spatial Network Databases (SNDBs) involves the following challenges: First, the distances between objects depend on their network connectivity and it is computationally expensive to compute these distances (e.g., shortest paths). Second, even when the distance can be approximated by simple vector distances, the query itself involves complex distance-based optimization problems. Several studies propose the use of Voronoi diagrams for spatial query processing in spatial networks. The ability of Voronoi diagrams to encode different geometric relationships based on arbitrary distance metrics in various spaces makes them ideal utilities to address the above challenges.

This entry shows the effectiveness of network Voronoi diagrams in answering two different spatial queries as case studies: k Nearest Neighbor (kNN) query finds the kclosest spatial objects to a given query...

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD international conference on management of data (SIGMOD’84), New York. ACM Press, pp 47–57

    Chapter  Google Scholar 

  • Hadjieleftheriou M, Kollios G, Bakalov P, Tsotras VJ (2005) Complex spatio-temporal pattern queries. In: Proceedings of the 31st international conference on very large data bases (VLDB’05), Trondheim, pp 877–888

    Google Scholar 

  • Hagedoorn M (2003) Nearest neighbors can be found efficiently if the dimension is small relative to the input size. In: Proceedings of the 9th international conference on database theory – ICDT 2003, Siena. Volume 2572 of lecture notes in computer science. Springer, pp 440–454

    Google Scholar 

  • Kolahdouzan M, Shahabi C (2004) Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB 2004, Toronto

    Google Scholar 

  • Korn F, Muthukrishnan S (2000) Influence sets based on reverse nearest neighbor queries. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data, Dallas. ACM Press, pp 201–212

    Chapter  Google Scholar 

  • Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng SH (2005) On trip planning queries in spatial databases. In: Proceedings of the 9th international symposium on spatial and temporal databases (SSTD’05), Angra dos Reis. Volume 3633 of lecture notes in computer science. Springer, pp 273–290

    Google Scholar 

  • Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial tessellations, concepts and applications of voronoi diagrams, 2nd edn. John Wiley and Sons Ltd., Chichester/New York

    Book  MATH  Google Scholar 

  • Papadias D, Zhang J, Mamoulis N, Tao Y Query processing in spatial network databases. In: VLDB 2003, Berlin

    Google Scholar 

  • Sharifzadeh M, Kolahdouzan M, Shahabi C (2007) The optimal sequenced route query. VLDB J 17:765–787

    Article  Google Scholar 

  • Sharifzadeh M, Shahabi C, Processing optimal sequenced route queries using voronoi diagrams. Submitted for review

    Google Scholar 

  • Sharifzadeh M, Shahabi C (2006a) Additively weighted voronoi diagrams for optimal sequenced route queries. In: Proceedings of the 3rd international workshop on spatio-temporal database management (STDBM’06), CEUR workshop proceedings

    Google Scholar 

  • Sharifzadeh M, Shahabi C (2006b) The spatial skyline queries. In: Proceedings of the 32nd international conference on very large data bases (VLDB’06), Seoul, pp 751–762

    Google Scholar 

  • Stanoi I, Riedewald M, Agrawal D, Abbadi AE (2001) Discovery of influence sets in frequently updated databases. In: Proceedings of the 27th international conference on very large data bases (VLDB’01), Roma. Morgan Kaufmann Publishers Inc., pp 99–108

    Google Scholar 

  • Terrovitis M, Bakiras S, Papadias D, Mouratidis K (2005) Constrained shortest path computation. In: Proceedings of the 9th international symposium on spatial and temporal databases (SSTD’05), Angra dos Reis. Volume 3633 of lecture notes in computer science. Springer, pp 181–199

    Google Scholar 

  • Zhang J, Zhu M, Papadias D, Tao Y, Lee DL (2003) Location-based spatial queries. In: Proceedings of the 2003 ACM SIGMOD international conference on management of data, San Diego. ACM Press, pp 443–454

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this entry

Cite this entry

Shahabi, C., Sharifzadeh, M. (2017). Voronoi Diagrams for Query Processing. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_1462

Download citation

Publish with us

Policies and ethics