VNU-UET Repository

An Efficient Parallel Method for Optimizing Concurrent Operations on Social Networks

Du, Phuong Hanh and Pham, Hai Dang and Nguyen, Ngoc Hoa (2018) An Efficient Parallel Method for Optimizing Concurrent Operations on Social Networks. Transactions on Computational Collective Intelligence, 29 . pp. 182-199. ISSN 2190-9288

This is the latest version of this item.

Full text not available from this repository.


This paper presents our approach to optimize the performance of both reading and writing concurrent operations on 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. And determining the relationship between any two members is similar to finding the shortest path between two vertices. 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 issue, we propose an efficient parallel method based on (i) utilizing an appropriate data structure, (ii) parallelizing 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 good experimental results compared to other solutions

Item Type: Article
Subjects: Information Technology (IT)
Scopus-indexed journals
ISI-indexed journals
Divisions: Faculty of Information Technology (FIT)
Depositing User: Assoc.Prof Hoá NGUYỄN Ngọc
Date Deposited: 07 Jun 2018 07:02
Last Modified: 07 Jun 2018 07:02

Available Versions of this Item

Actions (login required)

View Item View Item