Skip to main content
Log in

Geo-social group queries with minimum acquaintance constraints

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

The prosperity of location-based social networking has paved the way for new applications of group-based activity planning and marketing. While such applications heavily rely on geo-social group queries (GSGQs), existing studies fail to produce a cohesive group in terms of user acquaintance. In this paper, we propose a new family of GSGQs with minimum acquaintance constraints. They are more appealing to users as they guarantee a worst-case acquaintance level in the result group. For efficient processing of GSGQs on large location-based social networks, we devise two social-aware spatial index structures, namely SaR-tree and SaR*-tree. The latter improves on the former by considering both spatial and social distances when clustering objects. Based on SaR-tree and SaR*-tree, novel algorithms are developed to process various GSGQs. Extensive experiments on real datasets Gowalla and Twitter show that our proposed methods substantially outperform the baseline algorithms under various system settings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

Notes

  1. Such relation can be either a “friend” relation or a more intimate acquaintance relation, depending on the nature of the group event in a GSGQ service.

References

  1. Armenatzoglou, N., Papadopoulos, S., Papadias, D.: A general framework for geo-social query processing. In: Proceedings of VLDB (2013)

  2. Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the maximum k-plex problem. Oper. Res. 59(1), 133–142 (2011)

  3. Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. In: CoRR (2003)

  4. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of SIGMOD (1990)

  5. Cao, X., Cong, G., Jensen, C.S., Ooi, B.C.: Collective spatial keyword querying. In SIGMOD Conference (2011)

  6. Cheng, J., Ke, Y., Chu, S., Ozsu, M.T.: Efficient core decomposition in massive networks. In: Proceedings of ICDE (2011)

  7. De Felipe, I., Hristidis, V., Rishe, N.: Keyword search on spatial databases. In Proceedings of ICDE (2008)

  8. Doytsher, Y., Galon, B., Kanza, Y.: Querying geo-social data by bridging spatial networks and social networks. In: ACM LBSN (2010)

  9. Faloutsos, C., McCurley, K., Tomkins, A.: Fast discovery of connection subgraphs. In KDD (2004)

  10. Finkel, R., Bentley, J.L.: Quad trees: a data structure for retrieval on composite keys. Acta Informatica 4(1), 1–9 (1974)

  11. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  12. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. In Proceedings of the National Academy of Sciences of the USA (2002)

  13. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In Proceedings of SIGMOD (1984)

  14. Hao, F., Li, S., Min, G., Kim, H.-C., Yau, S.S., Yang L.T.: An efficient approach to generating location-sensitive recommendations in ad-hoc social network environments. IEEE Trans. Serv. Comput. 8(3), 520–533 (2015)

  15. Harary, F., Ross, I.C.: A procedure for clique detection using the group matrix. Sociometry 20(3), 205–215 (1957)

  16. Khalid, O., Khan, M.U.S., Khan, S.U., Zomaya, A.Y.: OmniSuggest: a ubiquitous cloud based context aware recommendation system for mobile social networks. IEEE Trans. Serv. Comput. 7(3), 401–414 (2014)

  17. Leskovec, J., Backstrom, L., Kumar, R., Tomkins, A.: Microscopic evolution of social networks. In KDD (2008)

  18. Li, Y., Chen, R., Chen, L., Xu, J.: Towards social-aware ridesharing group query services. IEEE Trans. Serv. Comput. (TSC). doi:10.1109/TSC.2015.2508440

  19. Li, Y., Chen, R., Xu, J., Huang, Q., Hu, H., Choi, B.: Geo-social k-cover group queries for collaborative spatial computing. IEEE Trans. Knowl. Data Eng. (TKDE) 27(8), 2729–2742 (2015)

    Article  Google Scholar 

  20. Liu, W., Sun, W., Chen, C., Huang, Y., Jing, Y., Chen, K.: Circle of friend query in geo-social networks. In DASFFA (2012)

  21. McClosky, B., Hicks, I.V.: Combinatorial algorithms for max k-plex. J. Combin. Optim. 23(1), 29–49 (2012)

  22. Moser, H., Niedermeier, R., Sorge,M.: Algorithms and experiments for clique relaxations-finding maximum s-plexes. In SEA (2009)

  23. Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In ICDE (2004)

  24. Schlegel, R., Chow, C.-Y., Huang, Q., Wong, D.S.: Privacy-preserving location sharing services for social networks. IEEE Trans. Serv. Comput. (2016). doi:10.1109/TSC.2016.2514338

  25. Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269–287 (1983)

  26. Shi, J., Mamoulis, N., Wu, D., Cheung, D.W.: Density-based place clustering in geo-social networks. In Proceedings of ACM SIGMOD (2014)

  27. Shin, K., Eliassi-Rad, T., Faloutsos, C.: CoreScope: graph mining using k-core analysis—patterns, anomalies, and algorithms. In Proceedings of IEEE ICDE (2016)

  28. Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In KDD (2010)

  29. Wu, D., Yiu, M.L., Jensen, C.S., Cong, G.: Efficient continuously moving top-k spatial keyword query processing. In Proceedings of ICDE (2011)

  30. Yang, D.-N., Chen, Y.-L., Lee, W.-C., Chen, M.-S.: On social-temporal group query with acquaintance constraint. In Proceedings of VLDB (2011)

  31. Yang, D.-N., Shen, C.-Y., Lee, W.-C., Chen, M.-S.: On socio-spatial group query for location-based social networks. In KDD (2012)

  32. Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K.H., Kitsuregawa, M.: Keyword search in spatial databases: towards searching by document. In Proceedings of ICDE (2009)

  33. Zhang, J.-D., Chow, C.-Y., Li, Y.: iGeoRec: a personalized and efficient geographical location recommendation framework. IEEE Trans. Serv. Comput. 8(5), 701–714 (2015)

  34. Zhang, J.-D., Chow, C.-Y.: iGSLR: personalized geo-social location recommendation—a kernel density estimation approach. In Proceedings of ACM GIS (2013)

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant Nos.: 61572413 and U1636205), and Research Grants Council, Hong Kong SAR, China, under Projects 12244916, 12201615, 12202414, 12200914, 15238116, and C1008-16G.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haibo Hu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhu, Q., Hu, H., Xu, C. et al. Geo-social group queries with minimum acquaintance constraints. The VLDB Journal 26, 709–727 (2017). https://doi.org/10.1007/s00778-017-0473-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-017-0473-6

Keywords

Navigation