Encyclopedia of GIS

2017 Edition
| Editors: Shashi Shekhar, Hui Xiong, Xun Zhou

Voronoi Diagrams for Query Processing

  • Cyrus Shahabi
  • Mehdi Sharifzadeh
Reference work entry
DOI: https://doi.org/10.1007/978-3-319-17885-1_1462

Synonyms

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 to check access.

References

  1. 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–57CrossRefGoogle Scholar
  2. 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–888Google Scholar
  3. 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–454Google Scholar
  4. Kolahdouzan M, Shahabi C (2004) Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB 2004, TorontoGoogle Scholar
  5. 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–212CrossRefGoogle Scholar
  6. 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–290Google Scholar
  7. 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 YorkCrossRefzbMATHGoogle Scholar
  8. Papadias D, Zhang J, Mamoulis N, Tao Y Query processing in spatial network databases. In: VLDB 2003, BerlinGoogle Scholar
  9. Sharifzadeh M, Kolahdouzan M, Shahabi C (2007) The optimal sequenced route query. VLDB J 17:765–787CrossRefGoogle Scholar
  10. Sharifzadeh M, Shahabi C, Processing optimal sequenced route queries using voronoi diagrams. Submitted for reviewGoogle Scholar
  11. 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 proceedingsGoogle Scholar
  12. 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–762Google Scholar
  13. 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–108Google Scholar
  14. 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–199Google Scholar
  15. 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–454CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Cyrus Shahabi
    • 1
    • 2
    • 3
    • 4
  • Mehdi Sharifzadeh
    • 5
  1. 1.Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA
  2. 2.Information Laboratory (InfoLab), Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA
  3. 3.University of Southern CaliforniaLos AngelesUSA
  4. 4.Integrated Media Systems CenterUniversity of Southern CaliforniaLos AngelesUSA
  5. 5.Information Laboratory (InfoLab), Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA