Large Scale Graph Analysis System by Shao Yingxia (33 results)

Condition: New.

Condition: New. In.

Condition: New. In.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Condition: New. 1st ed. 2020 edition NO-PA16APR2015-KAP.

Hardcover. Condition: new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback. Condition: new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condition: As New. Unread book in perfect condition.

Buch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 160 pp. Englisch.

Taschenbuch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 160 pp. Englisch.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Paperback. Condition: Brand New. 159 pages. 9.25x6.10x0.35 inches. In Stock.

Hardcover. Condition: Brand New. 159 pages. 9.25x6.10x0.59 inches. In Stock.

Condition: New.

Condition: New.

Paperback. Condition: new. Paperback. 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Hardcover. Condition: new. Hardcover. 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Shares techniques for optimizing large-scale graph algorithms in distributed settingsIntroduces three optimized graph analysis algorithms (i.e., subgraph enumeration, subgraph detection and graph extraction) for large graphsPresents .

Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 160 pp. Englisch.