Abstract
In this paper, we introduce a novel type of trip planning queries, a subgroup trip planning (SGTP) query that allows a group to identify the subgroup and the points of interests (POIs) from each required type (e.g., restaurant, shopping center, movie theater) that have the minimum aggregate trip distance for any subgroup size. The trip distance of a user starts at the user’s source location and ends at the user’s destination via the POIs. The computation of POI set for all possible subgroups with the straightforward application of group trip planning (GTP) algorithms would be prohibitively expensive. We propose an algorithm to compute answers for different subgroup size concurrently with less query processing overhead. We focus on both minimizing the total and maximum trip distance of the subgroup. We show the efficiency of our algorithms in experiments using both real and synthetic datasets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahmadi, E., Nascimento, M.A.: A mixed breadth-depth first search strategy for sequenced group trip planning queries. In: MDM, pp. 24–33 (2015)
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)
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–331 (1990)
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–308 (2012)
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–562 (2013)
Hashem, T., Barua, S., Ali, M.E., Kulik, L., Tanin, E.: Efficient computation of trips with friends and families. In: CIKM, pp. 931–940 (2015)
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–276. Springer, Heidelberg (2013)
Hashem, T., Kulik, L.: Safeguarding location privacy in wireless ad-hoc networks. In: Ubicomp, pp. 372–390 (2007)
Hashem, T., Kulik, L., Zhang, R.: Privacy preserving group nearest neighbor queries. In: EDBT, pp. 489–500 (2010)
Li, F., Yao, B., Kumar, P.: Group enclosing queries. IEEE TKDE 23(10), 1526–1540 (2011)
Li, Y., Li, F., Yi, K., Yao, B., Wang, M.: Flexible aggregate similarity search. In: SIGMOD, pp. 1009–1020 (2011)
Namnandorj, S., Chen, H., Furuse, K., Ohbo, N.: Efficient bounds in finding aggregate nearest neighbors. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds.) DEXA 2008. LNCS, vol. 5181, pp. 693–700. Springer, Heidelberg (2008)
Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, p. 301 (2004)
Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. TODS 30(2), 529–576 (2005)
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–127 (2015)
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–351 (2015)
Acknowledgments
This research is partially supported by the ICT Division - Government of the People’s Republic of Bangladesh.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Hashem, T., Hashem, T., Ali, M.E., Kulik, L., Tanin, E. (2016). Trip Planning Queries for Subgroups in Spatial Databases. In: Cheema, M., Zhang, W., Chang, L. (eds) Databases Theory and Applications. ADC 2016. Lecture Notes in Computer Science(), vol 9877. Springer, Cham. https://doi.org/10.1007/978-3-319-46922-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-46922-5_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46921-8
Online ISBN: 978-3-319-46922-5
eBook Packages: Computer ScienceComputer Science (R0)