Amazon cover image
Image from Amazon.com

Large-scale Graph Analysis: System, Algorithm and Optimization [electronic resource] /

By: Contributor(s): Material type: TextTextSeries: Big Data ManagementPublisher: Singapore : Springer Nature Singapore : Imprint: Springer, 2020Edition: 1st ed. 2020Description: XIII, 146 p. 78 illus., 30 illus. in color. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9789811539282
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 005.7 23
LOC classification:
  • QA76.9.B45
Online resources:
Contents:
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.
In: Springer Nature eBookSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

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.

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.

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in