TY  - CONF
ID  - SisLab2676
UR  - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2676/
A1  - Du, Phuong Hanh
A1  - Pham, Hai Dang
A1  - Nguyen, Ngoc Hoa
N2  - This paper presents our approach to optimize the concurrent operations on a large-scale social network. Here, we focus on the directed, unweighted relationships among members in a social network. It can then be illustrated as a directed, unweighted graph. With such a large-scale dynamic social network, we face the problem of having concurrent operations from adding or removing edges dynamically while one may ask to determine the relationship between two members. To solve this challenge, we propose an efficient parallel method based on (i) utilizing an appropriate data structure, (ii) optimizing the updating actions and (iii) improving the performance of query processing by both reducing the searching space and computing in multi-threaded parallel. Our method was validated by the datasets from SigMod Contest 2016 and SNAP DataSet Collections with the good experimental results compared to other solutions.
VL  - 10448
ED  - George, A. Papadopoulos
ED  - Nguyen, Ngoc Thanh
TI  - An Efficient Parallel Method for Performing Concurrent Operations on Social Networks
AV  - none
EP  - 159
Y1  - 2017/06//
PB  - Springer
T3  - Lecture Notes in Artificial Intelligence
SN  - 978-3-319-67073-7
SP  - 148
T2  - ICCCI: Conference on Computational Collective Intelligence Technologies and Applications
ER  -