{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T00:37:47Z","timestamp":1778373467667,"version":"3.51.4"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319724126","type":"print"},{"value":"9783319724133","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72413-3_11","type":"book-chapter","created":{"date-parts":[[2017,11,24]],"date-time":"2017-11-24T16:16:31Z","timestamp":1511540191000},"page":"164-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Trip Planning and Scheduling Queries in Spatial Databases: A Survey"],"prefix":"10.1007","author":[{"given":"Tanzima","family":"Hashem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Eunus","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,25]]},"reference":[{"key":"11_CR1","unstructured":"California road network data (2017). https:\/\/www.cs.utah.edu\/~lifeifei\/SpatialDataset.htm"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadi, E., Nascimento, M.A.: A mixed breadth-depth first search strategy for sequenced group trip planning queries. In: MDM, pp. 24\u201333 (2015)","DOI":"10.1109\/MDM.2015.49"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2829943","volume":"2","author":"ME Ali","year":"2016","unstructured":"Ali, M.E., Tanin, E., Scheuermann, P., Nutanong, S., Kulik, L.: Spatial consensus queries in a collaborative environment. ACM Trans. Spatial Algorithms Syst. 2(1), 3:1\u20133:37 (2016)","journal-title":"ACM Trans. Spatial Algorithms Syst."},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-18123-3_12","volume-title":"Database Systems for Advanced Applications","author":"S Aljubayrin","year":"2015","unstructured":"Aljubayrin, S., He, Z., Zhang, R.: Skyline trips of multiple POIs categories. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9050, pp. 189\u2013206. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18123-3_12"},{"key":"11_CR5","unstructured":"Anwar, A., Hashem, T.: Optimal obstructed sequenced route queries in spatial databases. In: EDBT, pp. 522\u2013525 (2017)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"issue":"11","key":"11_CR7","first-page":"1136","volume":"5","author":"X Cao","year":"2012","unstructured":"Cao, X., Chen, L., Cong, G., Xiao, X.: Keyword-aware optimal route search. PVLDB 5(11), 1136\u20131147 (2012)","journal-title":"PVLDB"},{"key":"11_CR8","first-page":"44","volume":"7","author":"IM Chao","year":"2011","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: \u201cDon\u2019t trust anyone\u201d: privacy protection for location-based services. PMC 7, 44\u201359 (2011)","journal-title":"PMC"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Chen, H., Ku, W., Sun, M., Zimmermann, R.: The multi-rule partial sequenced route query. In: SIGSPATIAL, pp. 10:1\u201310:10 (2008)","DOI":"10.1145\/1463434.1463448"},{"issue":"3\u20134","key":"11_CR10","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-64367-0_1","volume-title":"Advances in Spatial and Temporal Databases","author":"L Fan","year":"2017","unstructured":"Fan, L., Bonomi, L., Shahabi, C., Xiong, L.: Multi-user itinerary planning for optimal group preference. In: Gertz, M., et al. (eds.) SSTD 2017. LNCS, vol. 10411, pp. 3\u201323. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64367-0_1"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Ghinita, G., Kalnis, P., Khoshgozaran, A., Shahabi, C., Tan, K.: Private queries in location based services: anonymizers are not necessary. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, 10\u201312 June 2008, pp. 121\u2013132 (2008)","DOI":"10.1145\/1376616.1376631"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s11047-009-9111-6","volume":"9","author":"G Gutin","year":"2010","unstructured":"Gutin, G., Karapetyan, D.: A memetic algorithm for the generalized traveling salesman problem. Nat. Comput. 9(1), 47\u201360 (2010)","journal-title":"Nat. Comput."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-74853-3_22","volume-title":"UbiComp 2007: Ubiquitous Computing","author":"T Hashem","year":"2007","unstructured":"Hashem, T., Kulik, L.: Safeguarding location privacy in wireless ad-hoc networks. In: Krumm, J., Abowd, G.D., Seneviratne, A., Strang, T. (eds.) UbiComp 2007. LNCS, vol. 4717, pp. 372\u2013390. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74853-3_22"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Hashem, T., Kulik, L., Zhang, R.: Privacy preserving group nearest neighbor queries. In: EDBT, pp. 489\u2013500 (2010)","DOI":"10.1145\/1739041.1739100"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Hashem, T., Ali, M.E., Kulik, L., Tanin, E., Quattrone, A.: Protecting privacy for group nearest neighbor queries with crowdsourced data and computing. In: UbiComp, pp. 559\u2013562 (2013)","DOI":"10.1145\/2493432.2494524"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-40235-7_15","volume-title":"Advances in Spatial and Temporal Databases","author":"T Hashem","year":"2013","unstructured":"Hashem, T., Hashem, T., Ali, M.E., Kulik, L.: Group trip planning queries in spatial databases. In: Nascimento, M.A., Sellis, T., Cheng, R., Sander, J., Zheng, Y., Kriegel, H.-P., Renz, M., Sengstock, C. (eds.) SSTD 2013. LNCS, vol. 8098, pp. 259\u2013276. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40235-7_15"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Hashem, T., Barua, S., Ali, M.E., Kulik, L., Tanin, E.: Efficient computation of trips with friends and families. In: CIKM, pp. 931\u2013940 (2015)","DOI":"10.1145\/2806416.2806433"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-46922-5_9","volume-title":"Databases Theory and Applications","author":"T Hashem","year":"2016","unstructured":"Hashem, T., Hashem, T., Ali, M.E., Kulik, L., Tanin, E.: Trip planning queries for subgroups in spatial databases. In: Cheema, M.A., Zhang, W., Chang, L. (eds.) ADC 2016. LNCS, vol. 9877, pp. 110\u2013122. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46922-5_9"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/TKDE.2006.15","volume":"18","author":"H Hu","year":"2006","unstructured":"Hu, H., Lee, D.L.: Range nearest-neighbor query. IEEE Trans. Knowl. Data Eng. 18(1), 78\u201391 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"11_CR21","unstructured":"Jahan, R., Hashem, T., Barua, S.: Group trip scheduling (GTS) queries in spatial databases. In: EDBT, pp. 390\u2013401 (2017)"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1057\/jors.2009.76","volume":"61","author":"G Laporte","year":"2010","unstructured":"Laporte, G.: A concise guide to the traveling salesman problem. JORS 61(1), 35\u201340 (2010)","journal-title":"JORS"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11535331_16","volume-title":"Advances in Spatial and Temporal Databases","author":"F Li","year":"2005","unstructured":"Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273\u2013290. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535331_16"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.pmcj.2016.09.017","volume":"39","author":"MT Mahin","year":"2017","unstructured":"Mahin, M.T., Hashem, T., Kabir, S.: A crowd enabled approach for processing nearest neighbor and range queries in incomplete databases with accuracy guarantee. Pervasive Mob. Comput. 39, 249\u2013266 (2017)","journal-title":"Pervasive Mob. Comput."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Mokbel, M.F., Chow, C., Aref, W.G.: The new casper: a privacy-aware location-based database server. In: ICDE, pp. 1499\u20131500 (2007)","DOI":"10.1109\/ICDE.2007.369052"},{"issue":"8","key":"11_CR26","first-page":"692","volume":"5","author":"K Mouratidis","year":"2012","unstructured":"Mouratidis, K., Yiu, M.L.: Shortest path computation with no information leakage. PVLDB 5(8), 692\u2013703 (2012)","journal-title":"PVLDB"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-642-32600-4_36","volume-title":"Database and Expert Systems Applications","author":"Y Ohsawa","year":"2012","unstructured":"Ohsawa, Y., Htoo, H., Sonehara, N., Sakauchi, M.: Sequenced route query in road network distance based on incremental Euclidean restriction. In: Liddle, S.W., Schewe, K.-D., Tjoa, A.M., Zhou, X. (eds.) DEXA 2012. LNCS, vol. 7446, pp. 484\u2013491. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32600-4_36"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-319-44039-2_14","volume-title":"Advances in Databases and Information Systems","author":"Y Ohsawa","year":"2016","unstructured":"Ohsawa, Y., Htoo, H., Win, T.N.: Continuous trip route planning queries. In: Pokorn\u00fd, J., Ivanovi\u0107, M., Thalheim, B., \u0160aloun, P. (eds.) ADBIS 2016. LNCS, vol. 9809, pp. 198\u2013211. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44039-2_14"},{"key":"11_CR29","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, pp. 301\u2013310 (2004)"},{"issue":"2","key":"11_CR30","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst. 30(2), 529\u2013576 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"11_CR31","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","volume":"211","author":"C Rego","year":"2011","unstructured":"Rego, C., Gamboa, D., Glover, F., Osterman, C.: Traveling salesman problem heuristics: leading methods, implementations and latest advances. Eur. J. Oper. Res. 211(3), 427\u2013441 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","DOI":"10.1145\/568271.223794"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Samrose, S., Hashem, T., Barua, S., Ali, M.E., Uddin, M.H., Mahmud, M.I.: Efficient computation of group optimal sequenced routes in road networks. In: MDM, pp. 122\u2013127 (2015)","DOI":"10.1109\/MDM.2015.68"},{"issue":"4","key":"11_CR34","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s00778-006-0038-6","volume":"17","author":"M Sharifzadeh","year":"2008","unstructured":"Sharifzadeh, M., Kolahdouzan, M.R., Shahabi, C.: The optimal sequenced route query. VLDB J. 17(4), 765\u2013787 (2008)","journal-title":"VLDB J."},{"issue":"2","key":"11_CR35","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s11280-016-0384-2","volume":"20","author":"SC Soma","year":"2017","unstructured":"Soma, S.C., Hashem, T., Cheema, M.A., Samrose, S.: Trip planning queries with location privacy in spatial databases. World Wide Web 20(2), 205\u2013236 (2017)","journal-title":"World Wide Web"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Tabassum, A., Barua, S., Hashem, T., Chowdhury, T.: Dynamic group trip planning queries in spatial databases. In: SSDBM, pp. 38:1\u201338:6 (2017)","DOI":"10.1145\/3085504.3085584"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-13731-0_13","volume-title":"Algorithm Theory - SWAT 2010","author":"Z Xu","year":"2010","unstructured":"Xu, Z., Rodrigues, B.: A 3\/2-approximation algorithm for multiple depot multiple traveling salesman problem. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 127\u2013138. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13731-0_13"},{"issue":"6","key":"11_CR38","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"ML Yiu","year":"2005","unstructured":"Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. IEEE Trans. Knowl. Data Eng. 17(6), 820\u2013833 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72413-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:48:59Z","timestamp":1709826539000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-72413-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724126","9783319724133"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72413-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"25 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bigda2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bda2017.iiit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}