Large-scale Graph Analysis: System, Algorithm and Optimization
Author | : Yingxia Shao |
Publisher | : Springer Nature |
Total Pages | : 154 |
Release | : 2020-07-01 |
ISBN-10 | : 9789811539282 |
ISBN-13 | : 9811539286 |
Rating | : 4/5 (82 Downloads) |
Book excerpt: This book introduces readers to a workload-aware methodology for large-scale graph algorithm optimization in graph-computing systems, and proposes several optimization techniques that can enable these systems to handle advanced graph algorithms efficiently. More concretely, it proposes a workload-aware cost model to guide the development of high-performance algorithms. On the basis of the cost model, the book subsequently presents a system-level optimization resulting in a partition-aware graph-computing engine, PAGE. In addition, it presents three efficient and scalable advanced graph algorithms – the subgraph enumeration, cohesive subgraph detection, and graph extraction algorithms. This book offers a valuable reference guide for junior researchers, covering the latest advances in large-scale graph analysis; and for senior researchers, sharing state-of-the-art solutions based on advanced graph algorithms. In addition, all readers will find a workload-aware methodology for designing efficient large-scale graph algorithms.