Tutorial “Systems for Big-Graphs” by Arijit Khan and Sameh Elnikety (MSR, Redmond) has been accepted at VLDB 2014

The Tutorial entitled "Systems for Big-Graphs" by Arijit Khan and Sameh Elnikety (MSR, Redmond) has been accepted at VLDB 2014, Hangzhou, China, September 2014.

Abstract:

Graphs have become increasingly important to represent complicated structures and schema-less data including the World Wide Web, social networks, knowledge graphs, genome and scientific databases, e-commerce, medical and government records. Today’s big-graphs consist of millions of vertices and billions of edges. In the presence of data objects associated with vertices and edges, graph data can reach petabytes in size. In this tutorial, we discuss the design of the emerging systems for processing of big-graphs, key features of distributed graph algorithms, as well as graph partitioning and workload balancing techniques. We emphasize the current challenges and highlight some future research directions.