TY - JOUR
T1 - Towards Keyword-Based Geo-Social Group Query Services
AU - Zhu, Huaijie
AU - Liu, Wei
AU - Yin, Jian
AU - Xu, Jianliang
AU - Lee, Wang Chien
N1 - Funding information:
This work was supported in part by the National Natural Science Foundation of China under Grants 61902438, 61902439, U1811264, and U19112031, in part by the Natural Science Foundation of Guangdong Province under Grants 2019A1515011704 and 2019A1515011159, in part by Guangdong Basic and Applied Basic Research Foundation under Grant 2019B1515130001, in part by Guangdong Province Research and Development Project under Grant 2020B0101100001, in part by the National Science Foundation of USA under Grant IIS-1717084, and in part by Hong Kong RGC Grants 12202221 and 12201018. (Correpsonding author: Wei Liu.)
Publisher copyright:
© 2021 IEEE.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - In this article, we study a novel variant of geo-social group queries, namely, keyword-based geo-social group ( KGSG ) queries. Motivated by group-based activity planning, KGSG ensures that the attendees have a good social relationship , are close enough to the activity location , and are interested in the activity. Efficient processing of the KGSG query is very challenging as the problem is NP-hard. To address the challenge, we first propose two R-tree based algorithms, namely Distance Ordering based (Baseline) and Breadth Distance Ordering with Neighbor Expanding (BDONE). To further improve these two R-tree based algorithms, we propose a new keyword-aware social spatial index, called SIR-tree , which incorporates spatial, social, and keyword information into an R-tree. The novelty of SIR-tree lies in the idea of projecting the social relationships of an LBSN on the spatial layer which also maintains the users’ keyword information , to facilitate efficient KGSG query processing. Accordingly, we develop an efficient algorithm, called KGSG by SIR-tree Acceleration (KGSG-SIR), which exploits SIR-tree to accelerate query processing of KGSG. We conduct an extensive performance evaluation using four real datasets to validate our ideas and the proposed algorithms. The experimental result shows that the KGSG-SIR algorithm outperforms the two algorithms significantly.
AB - In this article, we study a novel variant of geo-social group queries, namely, keyword-based geo-social group ( KGSG ) queries. Motivated by group-based activity planning, KGSG ensures that the attendees have a good social relationship , are close enough to the activity location , and are interested in the activity. Efficient processing of the KGSG query is very challenging as the problem is NP-hard. To address the challenge, we first propose two R-tree based algorithms, namely Distance Ordering based (Baseline) and Breadth Distance Ordering with Neighbor Expanding (BDONE). To further improve these two R-tree based algorithms, we propose a new keyword-aware social spatial index, called SIR-tree , which incorporates spatial, social, and keyword information into an R-tree. The novelty of SIR-tree lies in the idea of projecting the social relationships of an LBSN on the spatial layer which also maintains the users’ keyword information , to facilitate efficient KGSG query processing. Accordingly, we develop an efficient algorithm, called KGSG by SIR-tree Acceleration (KGSG-SIR), which exploits SIR-tree to accelerate query processing of KGSG. We conduct an extensive performance evaluation using four real datasets to validate our ideas and the proposed algorithms. The experimental result shows that the KGSG-SIR algorithm outperforms the two algorithms significantly.
KW - Location-based services
KW - Geo-social group query
KW - nearest neighbor
KW - Keywords matching
UR - http://www.scopus.com/inward/record.url?scp=85115686557&partnerID=8YFLogxK
U2 - 10.1109/TSC.2021.3115132
DO - 10.1109/TSC.2021.3115132
M3 - Journal article
AN - SCOPUS:85115686557
SN - 1939-1374
VL - 16
SP - 670
EP - 683
JO - IEEE Transactions on Services Computing
JF - IEEE Transactions on Services Computing
IS - 1
ER -