Liebe Besucherinnen und Besucher,
aufgrund unseres Sommerfestes sind wir am 03. September 2026 bis 14 Uhr erreichbar. Am 04. September 2026 sind wir wieder wie gewohnt für Sie da. Vielen Dank für Ihr Verständnis.
Ihr Team von Sack Fachmedien
Buch, Englisch, 146 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 254 g
Reihe: Big Data Management
Buch, Englisch, 146 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 254 g
Reihe: Big Data Management
ISBN: 978-981-15-3930-5
Verlag: Springer
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 fordesigning efficient large-scale graph algorithms.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
1. Introduction.- 2. Graph Computing Systems for Large-Scale Graph Analysis.- 3. Partition-Aware Graph Computing System.- 4. Efficient Parallel Subgraph Enumeration.- 5. Efficient Parallel Graph Extraction.- 6. Efficient Parallel Cohesive Subgraph Detection.- 7. Conclusions.




