Abstract
POIs (points of interest) as well as users’ check-in information and their ratings on POIs have been widely studies in systems providing location-based services. We note that users usually have their own preferences for POI categories and their own network of friends. Therefore, we aim to provide for a group of users a new kind of POI-finding query that considers not only POI preferences of each user but also other aspects of location-based social networks such as users’ locations and POI ratings. We name such a new query as Spatial Group Preference (SGP) query. For a group of users, an SGP query returns top-k POIs that are much likely to satisfy the needs of users. Specially, we propose a new evaluation model that considers user preferences for user preferences for POI categories. Based on this model, we develop basic algorithms based on R-tree to evaluate SGP queries. Further, we design a new index structure called CR-tree to accelerate the query performance. We prove that CR-tree has better pruning efficiency than the traditional R-tree. We conduct experiments on a simulation dataset as well as two real datasets with respect to various configurations. The results suggest the efficiency of our proposal.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)
Papadias, D., Shen, Q., Tao, Y., et al.: Group nearest neighbor queries. In: ICDE, pp. 301–312 (2004)
Papadias, D., Tao, Y., Mouratidis, K., et al.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst. 30(2), 529–576 (2005)
Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate nearest neighbor queries in road networks. IEEE Trans. Knowl. Data Eng. 17(6), 820–833 (2005)
Ioup, E., Shaw, K., Sample, J., et al.: Efficient AKNN spatial network queries using the M-tree. In: SIGSPATIAL GIS, p. 46 (2007)
Zhu, L., Jing, Y., Sun, W., et al.: Voronoi-based aggregate nearest neighbor query processing in road networks. In: SIGSPATIAL GIS, pp. 518–521 (2010)
Li, H., Lu, H., Huang, B., et al.: Two ellipse-based pruning methods for group nearest neighbor queries. In: SIGSPATIAL GIS, pp. 192–199 (2005)
Li, F., Yao, B., Kumar, P.: Group enclosing queries. IEEE Trans. Knowl. Data Eng. 23(10), 1526–1540 (2011)
Li, Y., Li, F., Yi, K., et al.: Flexible aggregate similarity search. In: SIGMOD, pp. 1009–1020 (2011)
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)
Yiu, M.L., Dai, X., Mamoulis, N., et al.: Top-k spatial preference queries. In: ICDE, pp. 1076–1085 (2007)
Gao, Y., Wang, Y., Yi, S.: Preference-aware top-k spatio-textual queries. In: Song, S., Tong, Yongxin. (eds.) WAIM 2016. LNCS, vol. 9998, pp. 186–197. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-47121-1_16
Rocha-Junior, J.B., Gkorgkas, O., Jonassen, S., Nørvåg, K.: Efficient processing of top-k spatial keyword queries. In: Pfoser, D., et al. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 205–222. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22922-0_13
Cho, H.J., Kwon, S.J., Chung, T.S.: ALPS: an efficient algorithm for top-k spatial preference search in road networks. Knowl. Inform. Syst. 42(3), 599–631 (2015)
Attique, M., Cho, H.J., Jin, R., et al.: Top-k spatial preference queries in directed road networks. ISPRS. J. Geo Infor. 5(10), 170 (2016)
Rocha-Junior, J.B., Vlachou, A., Doulkeridis, C., Nørvåg, K.: Efficient processing of top-k spatial preference queries. Proc. VLDB Endow. 4(2), 93–104 (2010)
Li, M., Chen, L., Cong, G., et al.: Efficient processing of location-aware group preference queries. In: CIKM, pp. 559–568 (2016)
Rocha-Junior, J.B., Nørvag, K.: Top-k spatial keyword queries on road networks. In: EDBT, pp. 168–179 (2012)
Tian, Y., Jin, P., Wan, S., Yue, L.: Group preference queries for location-based social networks. In: APWeb/WAIM, pp. 556–564 (2017)
Zhang, D., Chan, C.-Y., Tan, K.-L.: Nearest group queries. In: SSDBM, pp. 7:1–7:12 (2013)
Acknowledgements
This work is supported by the National Key Research and Development Program of China (2018YFB0704400, 2018YFB0704404) and the National Science Foundation of China (61672479).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, Z., Jin, P., Tian, Y., Wan, S., Yue, L. (2019). Efficient Processing of Spatial Group Preference Queries. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds) Database Systems for Advanced Applications. DASFAA 2019. Lecture Notes in Computer Science(), vol 11447. Springer, Cham. https://doi.org/10.1007/978-3-030-18579-4_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-18579-4_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18578-7
Online ISBN: 978-3-030-18579-4
eBook Packages: Computer ScienceComputer Science (R0)