{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:09:50Z","timestamp":1725865790976},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319469218"},{"type":"electronic","value":"9783319469225"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46922-5_9","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T10:40:50Z","timestamp":1474368050000},"page":"110-122","source":"Crossref","is-referenced-by-count":3,"title":["Trip Planning Queries for Subgroups in Spatial Databases"],"prefix":"10.1007","author":[{"given":"Tanzima","family":"Hashem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tahrima","family":"Hashem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Eunus","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Kulik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egemen","family":"Tanin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"9_CR1","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":"9_CR2","first-page":"3","volume":"2","author":"ME Ali","year":"2016","unstructured":"Ali, M.E., Tanin, E., Scheuermann, P., Nutanong, S.: Spatial consensus queries in a collaborative environment. ACM Trans. Spat. Algorithms Syst. 2(1), 3 (2016)","journal-title":"ACM Trans. Spat. Algorithms Syst."},{"issue":"2","key":"9_CR3","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec. 19(2), 322\u2013331 (1990)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"9_CR4","first-page":"295","volume":"24","author":"K Deng","year":"2012","unstructured":"Deng, K., Sadiq, S.W., Xiaofang Zhou, H., Xu, H., Fung, G.P.C., Yansheng, L.: On group nearest group query processing. IEEE TKDE 24(2), 295\u2013308 (2012)","journal-title":"IEEE TKDE"},{"key":"9_CR5","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":"9_CR6","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":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Hashem, T., Kulik, L.: Safeguarding location privacy in wireless ad-hoc networks. In: Ubicomp, pp. 372\u2013390 (2007)","DOI":"10.1007\/978-3-540-74853-3_22"},{"key":"9_CR9","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"},{"issue":"10","key":"9_CR10","first-page":"1526","volume":"23","author":"F Li","year":"2011","unstructured":"Li, F., Yao, B., Kumar, P.: Group enclosing queries. IEEE TKDE 23(10), 1526\u20131540 (2011)","journal-title":"IEEE TKDE"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Li, Y., Li, F., Yi, K., Yao, B., Wang, M.: Flexible aggregate similarity search. In: SIGMOD, pp. 1009\u20131020 (2011)","DOI":"10.1145\/1989323.1989429"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/978-3-540-85654-2_60","volume-title":"Database and Expert Systems Applications","author":"S Namnandorj","year":"2008","unstructured":"Namnandorj, S., Chen, H., Furuse, K., Ohbo, N.: Efficient bounds in finding aggregate nearest neighbors. In: Bhowmick, S.S., K\u00fcng, J., Wagner, R. (eds.) DEXA 2008. LNCS, vol. 5181, pp. 693\u2013700. Springer, Heidelberg (2008)"},{"key":"9_CR13","unstructured":"Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, p. 301 (2004)"},{"issue":"2","key":"9_CR14","doi-asserted-by":"crossref","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. TODS 30(2), 529\u2013576 (2005)","journal-title":"TODS"},{"key":"9_CR15","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":"2","key":"9_CR16","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10115-013-0686-y","volume":"42","author":"D Yan","year":"2015","unstructured":"Yan, D., Zhao, Z., Ng, W.: Efficient processing of optimal meeting point queries in euclidean space and road networks. Knowl. Inf. Syst. 42(2), 319\u2013351 (2015)","journal-title":"Knowl. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46922-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:13:54Z","timestamp":1498346034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46922-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319469218","9783319469225"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46922-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}