Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 1–7Cite as

Trip Planning Queries

  • Living reference work entry
  • First Online:

  • 39 Accesses

Synonyms

Route queries; Trip planning queries; Trip recommendation

Definition

Given a set of points of interest (POIs) in two-dimensional space, where each point v i belongs to a specific category \( {C}_j\in C=\left\{{C}_0,\ {C}_1,\dots, {C}_m\right\} \), a starting point s, a destination point d, and a subset of categories \( R\subseteq C \), a trip planning query (TPQ) retrieves the best trip \( \tau =\langle s,{v}_0,\dots, {v}_k,d\rangle \) that starts at s, passes through at least one point from each category in R, and ends at d. Additionally, the trip τ has the minimum possible cost c(τ), where the cost metric may, for example, be the Euclidean distance or the traveling distance.

Example

A user may start a trip at home and plan to visit a bank and a gas station before arriving at a friend’s home. Both the bank and the gas station belong each to a category of points, because often which bank branch or which gas station is visited is not important, as long as they are on the way to...

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

Recommended Reading

  1. Cao X, Chen L, Cong G, Xiao X. Keyword-aware optimal route search. Proc. VLDB Endow., 2012;5(11):1136–1147.

    Google Scholar 

  2. Chan EPF, Zhang J. A fast unified opti- mal route query evaluation algorithm. In: Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, Lisbon, November 6–10, 2007. p. 371–80.

    Google Scholar 

  3. Chen H, Ku W-S, Sun M-T, Zimmermann R. The multi-rule partial sequenced route query. In: Proceedings of the 16th ACM SIGSPATIAL international conference on advances in geographic in- formation systems. GIS’08. New York; ACM; 2008. p. 10:1–10.

    Google Scholar 

  4. Chen H, Ku W-S, Sun M-T, Zimmermann R. The partial sequenced route query with traveling rules in road networks. Geoinformatica. 2011;15(3):541–69.

    Article  Google Scholar 

  5. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to algorithms. 3rd ed. Cambridge, Massachusetts, USA: The MIT Press; 2009.

    Google Scholar 

  6. Doytsher Y, Galon B, Kanza Y. Storing routes in socio-spatial networks and supporting social-based route recommendation. In: Proceedings of the 3rd ACM SIGSPATIAL international workshop on location-based social networks. LBSN’11. New York: ACM; 2011. p. 49–56.

    Google Scholar 

  7. Hart PE, Nilsson NJ, Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern (SSC4). 1968;4(2): 100–7.

    Article  Google Scholar 

  8. Hefez I, Kanza Y, Levin R. Tarsius: a system for traffic-aware route search under conditions of uncertainty. In: Proceedings of the 19th ACM SIGSPA- TIAL international conference on advances in geo- graphic information systems. GIS’11. New York: ACM; 2011. p. 517–20.

    Google Scholar 

  9. Henry-Labordere AL. The record balancing problem: a dynamic programming solution of a generalized traveling salesman problem. In: RIRO. 1969.

    Google Scholar 

  10. Hsieh H-P, Li C-T, Lin S-D. Exploiting large-scale check-in data to recommend time- sensitive routes. In: Proceedings of the ACM SIGKDD international workshop on urban computing, Urb- Comp’12. New York: ACM; 2012. p. 55–62.

    Google Scholar 

  11. Hsieh H-P, Li C-T, Lin S-D. Triprec: recommending trip routes from large scale check-in data. In: Proceedings of the 21st international conference companion on World Wide Web, WWW’12 Companion. New York: ACM; 2012. p. 529–30.

    Google Scholar 

  12. Kanza Y, Levin R, Safra E, Sagiv Y. An interactive approach to route search. In: Wolfson O, Agrawal D, Lu C-T, editors. GIS. ACM; 2009. p. 408–11.

    Google Scholar 

  13. Kim B, Lee Y, Lee S, Rhee Y-s, Song J. Towards trajectory- based experience sharing in a city. In: Proceedings of the 3rd ACM SIGSPATIAL international workshop on location-based social networks, LBSN’11. New York: ACM; 2011. p. 85–8.

    Google Scholar 

  14. Levin R, Kanza Y, Safra E, Sagiv Y. Interactive route search in the presence of order constraints. PVLDB. 2010;3(1):117–28.

    Google Scholar 

  15. Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng S-H. On trip planning queries in spatial databases. In: Proceedings of the 9th international conference on advances in spatial and temporal databases, SSTD’05. Berlin: Springer; 2005. p. 273–90.

    Google Scholar 

  16. Li J, Yang YD, Mamoulis N. Optimal route queries with arbitrary order constraints. IEEE Trans Knowl Data Eng. 2013;25(5):1097–110.

    Article  Google Scholar 

  17. Lu EH-C, Chen C-Y, Tseng VS. Personalized trip recommendation with multiple constraints by mining user check-in behaviors. In: Proceedings of the 20th international conference on advances in geographic information systems, SIGSPATIAL’12. New York: ACM; 2012. p. 209–18.

    Google Scholar 

  18. Lu EH-C, Chen H-S, Tseng VS. Efficient approaches for multi-requests route planning in urban areas. In: 2013 IEEE 14th International Conference on Mobile Data Management, vol 1; 2013. p. 36–45.

    Google Scholar 

  19. Lu EH-C, Lin C-Y, Tseng VS. Trip-mine: an efficient trip planning approach with travel time constraints. In: Proceedings of the 2011 IEEE 12th international conference on mobile data management, vol. 01, MDM’11. Washington, DC: IEEE Computer Society; 2012. p. 152–61.

    Google Scholar 

  20. Ma X, Shekhar S, Xiong H, Zhang P. Exploiting a page-level upper bound for multi- type nearest neighbor queries. In: Proceedings of the 14th annual ACM international symposium on advances in geographic information systems, GIS’06, New York: ACM; 2006. p. 179–86.

    Google Scholar 

  21. Malviya N, Madden S, Bhat-tacharya A. A continuous query system for dynamic route planning. In: Abiteboul S, Bhm K, Koch C, Tan K-L, editors. ICDE. IEEE Computer Society; 2011. p. 792–803.

    Google Scholar 

  22. Rice MN, Tsotras VJ. Parameterized algorithms for generalized traveling salesman problems in road networks. In: Proceedings of the 21st ACM SIGSPATIAL international conference on advances in geographic information systems, SIGSPA- TIAL’13. New York: ACM; 2013. p. 114–23.

    Google Scholar 

  23. Roy SB, Das G, Amer-Yahia S, Yu C. Interactive itinerary planning. 2014 IEEE 30th International Conference on Data Engineering; 2011. p. 15–26.

    Google Scholar 

  24. Sharifzadeh M, Kolahdouzan M, Shahabi C. The optimal sequenced route query. VLDB J. 2008;17(4):765–87.

    Article  Google Scholar 

  25. Srivastava SS, Kumar S, Garg RC, Sen P. Generalized travelling salesman problem through n sets of nodes. CORS. 1969;7:97.

    MathSciNet  MATH  Google Scholar 

  26. Xu J, Guo L, Ding Z, Sun X, Liu C. Traffic aware route planning in dynamic road networks. In: Lee Sg, Peng Z, Zhou X-f, Moon Y-S, Unland R, Yoo J-s, editors. DASFAA (1), Lecture notes in computer science, vol. 7238. Springer; 2012. p. 576–91.

    Google Scholar 

  27. Ye M, Yin P, Lee W-C. Location recommendation for location-based social networks. In: Proceedings of the 18th SIGSPATIAL international conference on advances in geographic information systems, GIS’10. New York: ACM; 2010. p. 458–61.

    Google Scholar 

  28. Ying JJ-C, Lee W-C, Ye M, Chen C-Y, Tseng VS. User association analysis of locales on location based social networks. In: Proceedings of the 3rd ACM SIGSPATIAL international workshop on location-based social networks, LBSN’11. New York: ACM; 2011. p. 69–76.

    Google Scholar 

  29. Yoon H, Zheng Y, Xie X, Woo W. Smart itinerary recommendation based on user-generated gps trajectories. In: Proceedings of the 7th international conference on Ubiquitous intelligence and computing, UIC’10. Berlin: Springer; 2010. p. 19–34.

    Google Scholar 

  30. Zheng Y, Xie X. Learning travel recommendations from user-generated gps traces. ACM Trans Intell Syst Technol. 2011;2(1):1–2.

    Article  Google Scholar 

  31. Zheng Y, Zhang L, Xie X, Ma W-Y. Mining interesting locations and travel sequences from gps trajectories. In: Proceedings of the 18th international conference on World wide web, WWW’09. New York: ACM; 2009. p. 791–800.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Information Engineering Department, National Chung Cheng University, Taiwan, Republic of China

    Yu-Ling Hsueh

  2. Department of Computer Science, School of Computing, National University of Singapore, Singapore, Republic of Singapore

    Roger Zimmermann

Authors
  1. Yu-Ling Hsueh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roger Zimmermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu-Ling Hsueh .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. Dept. of Computer Science and Eng., Hong Kong Univ. of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, Hong Kong SAR

    Dimitris Papadias

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

Hsueh, YL., Zimmermann, R. (2016). Trip Planning Queries. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_80712-1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_80712-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation