Advertisement

Efficient Trip Planning for Maximizing User Satisfaction

  • Chenghao Zhu
  • Jiajie XuEmail author
  • Chengfei Liu
  • Pengpeng Zhao
  • An Liu
  • Lei Zhao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9049)

Abstract

Trip planning is a useful technique that can find various applications in Location-Based Service systems. Though a lot of trip planning methods have been proposed, few of them have considered the possible constraints of POI sites in required types to be covered for user intended activities. In this paper, we study the problem of multiple-criterion-based trip search on categorical POI sites, to return users the trip that can maximize user satisfaction score within a given distance or travel time threshold. To address this problem, we propose a spatial sketch-based approximate algorithm, which extracts useful global information based on spatial clusters to guide effective trip search. The efficiency of query processing can be fully guaranteed because of the superior pruning effect on larger granularity. Experimental results on real dataset demonstrate the effectiveness of the proposed methods.

Keywords

Road Network Query Processing Satisfaction Score Priority Queue Execution Plan 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Roy, S.B., Das, G., Amer-Yahia, S., Yu, C.: Interactive itinerary planning. In: Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, Hannover, Germany, 11–16 April, pp. 15–26 (2011)Google Scholar
  2. 2.
    Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on A road network with speed patterns. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, Atlanta, GA, USA, 3–8 April, p. 10 (2006)Google Scholar
  3. 3.
    Li, F., Hadjieleftheriou, M., Kollios, G., Cheng, D., Teng, S.: Trip planning queries in road network databases. In: Encyclopedia of GIS, pp. 1176–1181 (2008)Google Scholar
  4. 4.
    Yang, B., Guo, C., Jensen, C.S., Kaul, M., Shang, S.: Stochastic skyline route planning under time-varying uncertainty. In: IEEE 30th International Conference on Data Engineering, Chicago, ICDE 2014, IL, USA, 31 March–4 April, pp. 136–147 (2014)Google Scholar
  5. 5.
    Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117–139. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  6. 6.
    Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005) CrossRefGoogle Scholar
  8. 8.
    Shang, S., Ding, R., Yuan, B., Xie, K., Zheng, K., Kalnis, P.: User oriented trajectory search for trip recommendation. In: Proceedings of the 15th International Conference on Extending Database Technology, EDBT 2012, Berlin, Germany, 27–30 March, pp. 156–167 (2012)Google Scholar
  9. 9.
    Sharifzadeh, M., Kolahdouzan, M.R., Shahabi, C.: The optimal sequenced route query. VLDB J. 17(4), 765–787 (2008)CrossRefGoogle Scholar
  10. 10.
    Yuan, J., Zheng, Y., Xie, X., Sun, G.: Driving with knowledge from the physical world. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, 21–24 August, pp. 316–324 (2011)Google Scholar
  11. 11.
    Horvitz, E., Krumm, J.: Some help on the way: opportunistic routing under uncertainty. In: The 2012 ACM Conference on Ubiquitous Computing, Ubicomp 2012, Pittsburgh, PA, USA, 5–8 September, pp. 371–380 (2012)Google Scholar
  12. 12.
    Tian, Y., Lee, K.C.K., Lee, W.: Finding skyline paths in road networks. In: Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2009, Seattle, Washington, USA, 4–6 November, pp. 444–447 (2009)Google Scholar
  13. 13.
    Safar, M., El-Amin, D., Taniar, D.: Optimized skyline queries on road networks using nearest neighbors. Personal and Ubiquitous Computing 15(8), 845–856 (2011)CrossRefGoogle Scholar
  14. 14.
    Zhu, A.D., Ma, H., Xiao, X., Luo, S., Tang, Y., Zhou, S.: Shortest path and distance queries on road networks: towards bridging theory and practice. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, New York, NY, USA, 22–27 June, pp. 857–868 (2013)Google Scholar
  15. 15.
    Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  16. 16.
    Sankaranarayanan, J., Samet, H., Alborzi, H.: Path oracles for spatial networks. PVLDB 2(1), 1210–1221 (2009)Google Scholar
  17. 17.
    Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, 6 January (2007)Google Scholar
  18. 18.
    Shang, S., Deng, K., Xie, K.: Best point detour query in road networks. In: Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2010, San Jose, CA, USA, 3–5 November, pp. 71–80 (2010)Google Scholar
  19. 19.
    Shang, S., Ding, R., Zheng, K., Jensen, C.S., Kalnis, P., Zhou, X.: Personalized trajectory matching in spatial networks. VLDB J. 23(3), 449–468 (2014)CrossRefGoogle Scholar
  20. 20.
    Zheng, K., Shang, S., Yuan, N.J., Yang, Y.: Towards efficient search for activity trajectories. In: 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, 8–12 April, pp. 230–241 (2013)Google Scholar
  21. 21.
    Chen, Z., Shen, H.T., Zhou, X., Zheng, Y., Xie, X.: Searching trajectories by locations: an efficiency study. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, 6–10 June, pp. 255–266 (2010)Google Scholar
  22. 22.
    Chen, Z., Shen, H.T., Zhou, X.: Discovering popular routes from trajectories. In: Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, Hannover, Germany, 11–16 April, pp. 900–911 (2011)Google Scholar
  23. 23.
    Zheng, K., Trajcevski, G., Zhou, X., Scheuermann, P.: Probabilistic range queries for uncertain trajectories on road networks. In: Proceedings of the EDBT 2011, 14th International Conference on Extending Database Technology, Uppsala, Sweden, 21–24 March, pp. 283–294 (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Chenghao Zhu
    • 1
  • Jiajie Xu
    • 1
    • 3
    Email author
  • Chengfei Liu
    • 2
  • Pengpeng Zhao
    • 1
    • 3
  • An Liu
    • 1
    • 3
  • Lei Zhao
    • 1
    • 3
  1. 1.School of Computer Science and TechnologySoochow UniversitySuzhouChina
  2. 2.Faculty of ICTSwinburne University of TechnologyMelbourneAustralia
  3. 3.Collaborative Innovation Center of Novel Software Technology and IndustrializationNanjingChina

Personalised recommendations