Geodesic
Nearest Close Friend Query in Road-Social Networks
Computer Science and Information Systems, Tome 19 (2022) no. 3.

Voir la notice de l'article provenant de la source Computer Science and Information Systems website

Nearest close friend query (k`NCF) in geo-social networks, aims to find the k nearest user objects from among the `-hop friends of the query user. Existing efforts on k`-NCF find the user objects in the Euclidean space. In this paper, we study the problem of nearest close friend query in road-social networks. We propose two methods. One is based on Dijkstra algorithm, and the other is based on IS-Label. For the Dijkstra-based method, Dijkstra algorithm is used to traverse the user objects needed. For the label-based method, we make use of IS-Label to calculate the distance between two vertices to avoid traversing the edges that do not contain the desired user object. For each method, we propose effective termination conditon to terminate the query process early. Finally, we conduct a variety of experiments on real and synthetic datasets to verify the efficiency of the proposed methods.
Keywords: road-social networks, R-tree, IS-Label index, nearest neighbor query 
@article{CSIS_2022_19_3_a10,
     author = {Zijun Chen and Ruoyu Jiang and Wenyuan Liu},
     title = {Nearest {Close} {Friend} {Query} in {Road-Social} {Networks}},
     journal = {Computer Science and Information Systems},
     publisher = {mathdoc},
     volume = {19},
     number = {3},
     year = {2022},
     url = {http://geodesic.mathdoc.fr/item/CSIS_2022_19_3_a10/}
}
TY  - JOUR
AU  - Zijun Chen
AU  - Ruoyu Jiang
AU  - Wenyuan Liu
TI  - Nearest Close Friend Query in Road-Social Networks
JO  - Computer Science and Information Systems
PY  - 2022
VL  - 19
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CSIS_2022_19_3_a10/
ID  - CSIS_2022_19_3_a10
ER  - 
%0 Journal Article
%A Zijun Chen
%A Ruoyu Jiang
%A Wenyuan Liu
%T Nearest Close Friend Query in Road-Social Networks
%J Computer Science and Information Systems
%D 2022
%V 19
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CSIS_2022_19_3_a10/
%F CSIS_2022_19_3_a10
Zijun Chen; Ruoyu Jiang; Wenyuan Liu. Nearest Close Friend Query in Road-Social Networks. Computer Science and Information Systems, Tome 19 (2022) no. 3. http://geodesic.mathdoc.fr/item/CSIS_2022_19_3_a10/