.png){kind=icon}
.png){kind=icon}
Return
A Survey on Concurrent Processing of Graph Analytical Queries: Systems and Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2024.3393936.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph analytical queries (GAQs) are becoming increasingly important in various domains, including social networks, recommendation systems, and bioinformatics, among others. GAQs typically require iterative processing of the graph data to compute various metrics and identify patterns or anomalies. Parallel to the burgeoning demand for graph analytics, the need for Concurrent Graph Analytical Queries (CGAQs), allowing simultaneous execution of multiple graph queries, is increasing. Within social networks, CGAQs bolster real-time analytics, concurrently investigate various network properties, such as community detection, path analysis, and influence propagation. In transportation, CGAQs concurrently optimize multiple routes and manage real-time traffic data, contributing significantly to efficient supply chain strategies and traffic management. The key property of CGAQs lies in their capacity for shared processing, exploiting the synergies between concurrent queries, which in return opens opportunities for improved system scalability and throughput. In this survey, we present a comprehensive review of system-level and algorithm-level efforts to support CGAQ processing. We introduce a novel survey framework based on three aspects: 1) What are the sharing opportunities exploited? 2) What are the scheduling techniques proposed to maximize sharing? 3) What are the optimizations employed? We also identify important gaps and promising research directions for CGAQ processing.
Keywords:
Surveys
Optimization
Processor scheduling
Pattern matching
Social networking (online)
Reviews
Resource management
Concurrent computing
data systems
network theory
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W
Organization
View more organizations