# Introduction to Graph Computing Training Course

graphcomputing

## Duration

28 hours (usually 4 days including breaks)

## Requirements

• An undersanding of Java programming and frameworks
• A general understanding of Python is helpful but not required
• A general understanding of database concepts

Audience

• Developers

## Overview

Many real world problems can be described in terms of graphs. For example, the Web graph, the social network graph, the train network graph and the language graph. These graphs tend to be extremely large; processing them requires a specialized set of tools and processes -- these tools and processes can be referred to as Graph Computing (also known as Graph Analytics).

In this instructor-led, live training, participants will learn about the technology offerings and implementation approaches for processing graph data. The aim is to identify real-world objects, their characteristics and relationships, then model these relationships and process them as data using a Graph Computing (also known as Graph Analytics and Distributed Graph Processing) approach. We start with a broad overview and narrow in on specific tools as we step through a series of case studies, hands-on exercises and live deployments.

By the end of this training, participants will be able to:

• Understand how graph data is persisted and traversed.
• Select the best framework for a given task (from graph databases to batch processing frameworks.)
• Implement Hadoop, Spark, GraphX and Pregel to carry out graph computing across many machines in parallel.
• View real-world big data problems in terms of graphs, processes and traversals.

Format of the course

• Part lecture, part discussion, exercises and heavy hands-on practice

## Course Outline

Introduction

• Graph databases and libraries

Understanding Graph Data

• The graph as a data structure
• Using vertices (dots) and edges (lines) to model real-world scenarios

Using Graph Databases to Model, Persist and Process Graph Data

• Local graph algorithms/traversals
• neo4j, OrientDB and Titan

Exercise: Modeling Graph Data with neo4j

• Whiteboard data modeling

Beyond Graph Databases: Graph Computing

• Understanding the property graph
• Graph modeling different scenarios (software graph, discussion graph, concept graph)

Solving Real-World Problems with Traversals

• Algorithmic/directed walk over the graph
• Determining circular cependencies

Case Study: Ranking Discussion Contributors

• Ranking by number and depth of contributed discussions
• A note on sentiment and concept analysis

Graph Computing: Local, In-Memory Graph toolkits

• Graph analysis and visualization
• JUNG, NetworkX, and iGraph

Exercise: Modeling Graph Data with NetworkX

• Using NetworkX to model a complex system

Graph Computing: Batch Processing Graph Frameworks

• Leveraging Hadoop for storage (HDFS) and processing (MapReduce)
• Overview of iterative algorithms
• Hama, Giraph, and GraphLab

Graph Computing: Graph-Parallel Computation

• Unifying ETL, exploratory analysis, and iterative graph computation within a single system
• GraphX

Setup and Installation

GraphX Operators

• Property, structural, join, neighborhood aggregation, caching and uncaching

Iterating with Pregel API

• Passing arguments for sending, receiving and computing

Building a Graph

• Using vertices and edges in an RDD or on disk

Designing Scalable Algorithms

• GraphX Optimization

• PageRank, Connected Components, Triangle Counting

Exercis: Page Rank and Top Users

• Building and processing graph data using text files as input

Deploying to Production

Closing Remarks

★★★★★
★★★★★
{"ft_lang_label":"__label__en","ft_lang_prob":0.83378947,"math_prob":0.5944048,"size":3603,"snap":"2021-43-2021-49","text_gpt3_token_len":744,"char_repetition_ratio":0.13253681,"word_repetition_ratio":0.018796992,"special_character_ratio":0.18290314,"punctuation_ratio":0.09252669,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9646847,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-05T21:14:48Z\",\"WARC-Record-ID\":\"<urn:uuid:f0028a59-72d0-4565-84c3-458d171e521a>\",\"Content-Length\":\"159373\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:457b0e1d-1568-42b9-84b5-1d1f5fa034d2>\",\"WARC-Concurrent-To\":\"<urn:uuid:6bf6099c-ba6c-4710-92c6-d10a3e903e35>\",\"WARC-IP-Address\":\"18.134.119.47\",\"WARC-Target-URI\":\"https://www.nobleprog.co.uk/cc/graphcomputing?id=graphcomputing-121260-20211116\",\"WARC-Payload-Digest\":\"sha1:63QF3TF47WNRSZV5XMGATKFF2RPSOQSG\",\"WARC-Block-Digest\":\"sha1:BNI74HGFD7KWV6VXF54MXJJVSNIVMAWZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964363216.90_warc_CC-MAIN-20211205191620-20211205221620-00044.warc.gz\"}"}