Computational graph analytics for massive streaming data

David Ediger, Jason Riedy, David A. Bader, Henning Meyerhenke

Research output: Chapter in Book/Report/Conference proceedingChapter

8 Scopus citations


In this chapter the author presents a new, extensible and flexible data structure for massive graphs called STINGER (Spatio-Temporal Interaction Networks and Graphs (STING) Extensible Representation). Two studies are discussed: the first study, computing a widely used network analysis metric called clustering coefficients, and the second study, the approach for tracking connected components given a stream of edge insertions and removals. The chapter describes the massively multithreaded Cray XMT as well as the more common platform built on Intel’s Nehalem architecture. It presents experimental results on the Cray XMT, with a comparison to the Intel Nehalem platform for the clustering coefficient problem. Regarding clustering coefficients, a similar rate of 200,000 updates per second can be maintained on the Cray XMT.

Original languageEnglish (US)
Title of host publicationLarge Scale Network-Centric Distributed Systems
Number of pages29
ISBN (Electronic)9781118640708
ISBN (Print)9780470936887
StatePublished - Jan 1 2013
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • General Engineering
  • General Social Sciences
  • General Computer Science


  • Approximation methods
  • Batteries
  • Discrete wavelet transforms
  • Fuel cells
  • Multiresolution analysis
  • Standards


Dive into the research topics of 'Computational graph analytics for massive streaming data'. Together they form a unique fingerprint.

Cite this