Skip to main content
SpringerLink
Log in

Constrained Shortest Path Computation

  • Conference paper
Advances in Spatial and Temporal Databases (SSTD 2005)

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

Included in the following conference series:

Abstract

This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an a-autonomy query retrieves a sequence of data points connecting s and d, such that the distance between any two consecutive points in the path is not greater than a. A k-stops query retrieves a sequence that contains exactly k intermediate data points. In both cases our aim is to compute the shortest path subject to these constraints. Assuming that the dataset is indexed by a data-partitioning method, the proposed techniques initially compute a sub-optimal path by utilizing the Euclidean distance information provided by the index. The length of the retrieved path is used to prune the search space, filtering out large parts of the input dataset. In a final step, the optimal (a-autonomy or k-stops) path is computed (using only the non-eliminated data points) by an exact algorithm. We discuss several processing methods for both problems, and evaluate their efficiency through extensive experiments.

Supported by grant HKUST 6180/03E from Hong Kong RGC.

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

Access this chapter

Log in via an institution
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. Balas, E.: The prize collecting travelling salesman problem. Networks 19, 621–636 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322–331 (1990)

    Google Scholar 

  3. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)

    Google Scholar 

  4. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71–79 (1995)

    Google Scholar 

  5. Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM TODS 24, 265–318 (1999)

    Article  Google Scholar 

  6. Papadias, D., Tao, Y., Mouratidis, K., Hui, C.: Aggregate nearest neighbor queries in spatial databases. ACM TODS (2005) (to appear)

    Google Scholar 

  7. Dijkstra, E.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  8. Shekhar, S., Kohli, A., Coyle, M.: Path computation algorithms for advanced traveller information system (ATIS). In: ICDE, pp. 31–39 (1993)

    Google Scholar 

  9. Bellman, R.: On a routing problem. Quarterly of Applied Mathematics 16, 87–90 (1958)

    MATH  MathSciNet  Google Scholar 

  10. Ford, L., Fukelson, D.: Flows in networks. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

  11. Floyd, R.: Shortest path. Communications of the ACM 5, 345 (1962)

    Article  Google Scholar 

  12. Jung, S., Pramanik, S.: HiTi graph model of topographical roadmaps in navigation systems. In: ICDE, pp. 76–84 (1996)

    Google Scholar 

  13. Jing, N., Huang, Y., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE TKDE 10, 409–432 (1998)

    Google Scholar 

  14. Jiang, B.: I/O-efficiency of shortest path algorithms: An analysis. In: ICDE, pp. 12–19 (1992)

    Google Scholar 

  15. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802–813 (2003)

    Google Scholar 

  16. Kolahdouzan, M.R., Shahabi, C.: Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB, pp. 840–851 (2004)

    Google Scholar 

  17. Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. In: GIS, pp. 94–100 (2002)

    Google Scholar 

  18. Jensen, C.S., Kolárvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: GIS, pp. 1–8 (2003)

    Google Scholar 

  19. Shekhar, S., Yoo, J.S.: Processing in-route nearest neighbor queries: a comparison of alternative approaches. In: GIS, pp. 9–16 (2003)

    Google Scholar 

  20. Yiu, M.L., Mamoulis, N.: Clustering objects on a spatial network. In: SIGMOD, pp. 443–454 (2004)

    Google Scholar 

  21. Huang, Y., Jing, N., Rundensteiner, E.A.: Integrated query processing strategies for spatial path queries. In: ICDE, pp. 477–486 (1997)

    Google Scholar 

  22. Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB, pp. 287–298 (2002)

    Google Scholar 

  23. Ferhatosmanoglu, H., Stanoi, I., Agrawal, D., Abbadi, A.: Constrained nearest neighbor queries. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 257–278. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering Department, National Technical University of Athens, Greece

    Manolis Terrovitis

  2. Computer Science Department, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

    Spiridon Bakiras, Dimitris Papadias & Kyriakos Mouratidis

Authors
  1. Manolis Terrovitis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Spiridon Bakiras
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dimitris Papadias
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kyriakos Mouratidis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computing, CP 6176, University of Campinas, 13084-971, Campinas, Brazil

    Claudia Bauzer Medeiros

  2. National Center for Geographic Information and Analysis and Department of Spatial Information Science and Engineering, University of Maine, Boardman Hall, ME 04469-5711, Orono, USA

    Max J. Egenhofer

  3. Purdue University,  

    Elisa Bertino

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Terrovitis, M., Bakiras, S., Papadias, D., Mouratidis, K. (2005). Constrained Shortest Path Computation. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds) Advances in Spatial and Temporal Databases. SSTD 2005. Lecture Notes in Computer Science, vol 3633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535331_11

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28127-6

  • Online ISBN: 978-3-540-31904-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation