Skip to main content
SpringerLink
Log in

Processing Optimal Sequenced Route Queries Using Voronoi Diagrams

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

The Optimal Sequenced Route (OSR) query strives to find a route of minimum length starting from a given source location and passing through a number of typed locations in a specific sequence imposed on the types of the locations. In this paper, we propose a pre-computation approach to OSR query in both vector and metric spaces. We exploit the geometric properties of the solution space and theoretically prove its relation to additively weighted Voronoi diagrams. Our approach recursively accesses these diagrams to incrementally build the OSR. Introducing the analogous diagrams for the space of road networks, we show that our approach is also efficiently applicable to this metric space. Our experimental results verify that our pre-computation approach outperforms the previous index-based approaches in terms of query response time.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Notes

  1. ℝd and D(.,.) form a metric space.

  2. Many spatial networks consist of directed edges and hence must be modeled as directed graphs. Throughout the paper, we use undirected graphs for simplicity. However, our algorithms can be easily extended to support directed graphs.

  3. http://www.cgal.org/.

References

  1. Y. Du, D. Zhang, and T. Xia. “The optimal-location query,” in Proc. of SSTD’05, Angra dos Reis, Brazil, pp. 163–180, Springer, 2005.

  2. C. du Mouza, P. Rigaux, and M. Scholl. “Efficient evaluation of parameterized pattern queries,” in Proceedings of CIKM’05, Bremen, Germany, pp. 728–735, ACM, 2005.

  3. M. Erwig. “The graph Voronoi diagram with applications,” Networks, Vol. 36(3):156–163, 2000.

    Article  Google Scholar 

  4. M. Hadjieleftheriou, G. Kollios, P. Bakalov, and V.J. Tsotras. “Complex spatio-temporal pattern queries,” in Proc. of VLDB’05, Trondheim, Norway, pp. 877–888, 2005.

  5. M.I. Karavelas and M. Yvinec. “Dynamic additively weighted Voronoi diagrams in 2d,” in Proc. of the 10th Annual European Symposium on Algorithms (ESA’02), London, UK, pp. 586–598, Springer-Verlag, 2002.

  6. M. Kolahdouzan and C. Shahabi. “Voronoi-based K nearest neighbor search for spatial network databases,” in VLDB 2004, Toronto, Canada, 2004.

  7. F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios, and S.-H. Teng. “On trip planning queries in spatial databases,” in Proceedings of SSTD’05, Angra dos Reis, Brazil, pp. 273–290. Springer, 2005.

  8. A. Okabe, B. Boots, K. Sugihara, and S.N. Chiu. Spatial Tessellations, Concepts and Applications of Voronoi Diagrams. 2nd edition, John Wiley: New York, 2000.

    Google Scholar 

  9. Y. Ostrovksy-Berman. “Computing transportation Voronoi diagrams in optimal time,” in Proc. of the 21st European Workshop on Computational Geometry (EWCG’05), Eindhoven, the Netherlands, pp. 159–162, 2005.

  10. M. Sharifzadeh, M. Kolahdouzan, and C. Shahabi. “The optimal sequenced route query,” The VLDB Journal: The International Journal on very Large Data Bases, SSN: 1066-8888 (Print) 0949-877X (Online), doi:10.1007/s00778-006-0038-6, Issue: Online First, 2007.

  11. M. Sharifzadeh and C. Shahabi. “Additively weighted Voronoi diagrams for optimal sequenced route queries,” in Proc. of the 3rd International Workshop on Spatio-Temporal Database Management (STDBM’06), Seoul, Korea, 2006. CEUR Workshop Proceedings, online http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS//Vol-174/paper5.pdf.

  12. M. Terrovitis, S. Bakiras, D. Papadias, and K. Mouratidis. “Constrained shortest path computation,” in Proc. of SSTD’05, Angra dos Reis, Brazil, pp. 181–199, Springer, 2005.

Download references

Author information

Authors and Affiliations

  1. Information Laboratory (InfoLab), Computer Science Department, University of Southern California, Los Angeles, CA, 90089-0781, USA

    Mehdi Sharifzadeh & Cyrus Shahabi

Authors
  1. Mehdi Sharifzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cyrus Shahabi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mehdi Sharifzadeh.

Additional information

This research has been funded in part by NSF grants EEC-9529152 (IMSC ERC), IIS-0238560 (PECASE), IIS-0324955 (ITR), IIS-0534761, and unrestricted cash gifts from Google and Microsoft. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the NSF.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sharifzadeh, M., Shahabi, C. Processing Optimal Sequenced Route Queries Using Voronoi Diagrams. Geoinformatica 12, 411–433 (2008). https://doi.org/10.1007/s10707-007-0034-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-007-0034-z

Keywords

Search

Navigation