Geo-social group queries with minimum acquaintance constraints

Qijun Zhu, Haibo Hu*, Cheng Xu, Jianliang Xu, Wang Chien Lee

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

58 Citations (Scopus)
39 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)709-727
Number of pages19
JournalVLDB Journal
Issue number5
Early online date19 Jul 2017
Publication statusPublished - Oct 2017

Scopus Subject Areas

  • Information Systems
  • Hardware and Architecture

User-Defined Keywords

  • Geo-social networks
  • Location-based services
  • Nearest neighbor queries
  • Spatial queries


Dive into the research topics of 'Geo-social group queries with minimum acquaintance constraints'. Together they form a unique fingerprint.

Cite this