Explore the cutting-edge world of graph stream processing in this Google TechTalk presented by David Tench. Dive into the limitations of existing systems and discover how linear sketching data structures can revolutionize the processing of massive-scale graphs. Learn about a novel sketching algorithm for connected components and its high-performance implementation. Gain insights into the numerous open problems and potential applications in the field of graph sketching algorithms. Understand how these techniques can overcome RAM limitations and enable the processing of truly massive graphs, pushing the boundaries of what's possible in graph computation.
Overview
Syllabus
Dynamic Graph Sketching: To Infinity And Beyond
Taught by
Google TechTalks