Reference architecture for social networks graph analysis tool
Abstract
When analyzing social networks, graph data structures are often used. Such graphs may have a complex structure that makes their operational analysis difficult or even impossible. This paper discusses the key problems that researchers face in the field of processing big graphs in that particular area. The paper proposes a reference architecture for storage, analysis and visualization of social network graphs, as well as a big graph process "Pipeline". Based on this pipeline it is possible to develop a tool that will be able to filter, aggregate and process in parallel big graphs of social networks, and at the same time take into account its structure. The paper includes the implementation of that pipeline using the OrientDB graph database for storage, parallel processing for graph measures calculation and visualization of big graphs using D3. The paper also includes the conducted experiments based on the calculation of betweenness centrality of some graphs collected from the VKontakte social net.
Domains
Computer Science [cs] Social and Information Networks [cs.SI] Computer Science [cs] Performance [cs.PF] Computer Science [cs] Networking and Internet Architecture [cs.NI] Computer Science [cs] Modeling and Simulation Computer Science [cs] Data Structures and Algorithms [cs.DS] Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Artificial Intelligence [cs.AI] Computer Science [cs] Distributed, Parallel, and Cluster Computing [cs.DC]
Fichier principal
Graphs_analysis_based_on_big_data__challenges__solutions_and_prospects_.pdf (7.17 Mo)
Télécharger le fichier
Origin : Files produced by the author(s)
Loading...