.png){kind=icon}
.png){kind=icon}
Return
Graph Computing Systems and Partitioning Techniques: A Survey
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3219422.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graphs are a tremendously suitable data representations that model the relationships of entities in many application domains, such as recommendation systems, machine learning, computational biology, social network analysis, and other application domains. Graphs with many vertices and edges have become quite prevalent in recent years. Therefore, graph computing systems with integrated various graph partitioning techniques have been envisioned as a promising paradigm to handle large-scale graph analytics in these application domains. However, scalable processing of large-scale graphs is challenging due to their high volume and inherent irregular structure of the real-world graphs. Hence, industry and academia have been recently proposing graph partitioning and computing systems to process and analyze large-scale graphs efficiently. The graph partitioning and computing systems have been designed to improve scalability issues and reduce processing time complexity. This paper presents an overview, classification, and investigation of the most popular graph partitioning and computing systems. The various methods and approaches of graph partitioning and diverse categories of graph computing systems are presented. Finally, we discuss main challenges and future research directions in graph partitioning and computing systems.
Keywords:
Distributed computing
graph computing systems
graph partitioning
graph processing systems
graph databases
graph algorithm
large-scale graph analysis
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
View more organizations