Corpus ID: 18153162

STINGER : Spatio-Temporal Interaction Networks and Graphs ( STING ) Extensible Representation

  title={STINGER : Spatio-Temporal Interaction Networks and Graphs ( STING ) Extensible Representation},
  author={David A. Bader and Daniel Chavarrı́a-Miranda},
In this document, we propose a dynamic graph data structure that can serve as a common data structure for multiple real-world applications. The extensible representation for dynamic complex networks is space-efficient, allows parallelism over vertices and edges independently, and can be used for efficient checkpoint/restart of the data. 

Figures from this paper

Analysis of streaming social networks and graphs on multicore architectures
A framework for monitoring a dynamic graph's connected components, and an exact algorithm for maintaining local clustering coefficients performs better on Intel-based platforms than the earlier approximate algorithm. Expand
STINGER: High performance data structure for streaming graphs
This paper presents high performance, scalable and portable software that includes a graph data structure that enables these applications, STINGER, and demonstrates a process of algorithmic and architectural optimizations that enable high performance on the Cray XMT family and Intel multicore servers. Expand
A new parallel algorithm for connected components in dynamic graphs
This work presents a novel parallel algorithm for tracking the connected components of a dynamic graph that is up to 128X faster than well-known static algorithms and that the algorithm achieves a 14X parallel speedup on a x86 64-core shared-memory system. Expand
DISTINGER: A distributed graph data structure for massive dynamic graph processing
This paper presents DISTINGER, a distributed graph representation that handles massive graph analytics with streaming updates, and implements the design and algorithms as a prototype, and compares it to single-site STINGER and state-of-art graph systems. Expand
Distributed Programming over Time-Series Graphs
This work formalizes the notion of time-series graphs and proposes a Temporally Iterative BSP programming abstraction to develop algorithms on such datasets using several design patterns and abstractions, and demonstrates the efficacy of the abstractions to develop practical time- series graph algorithms, and scale them on commodity hardware. Expand
Efficient Data Structures for Dynamic Graph Analysis
This paper provides compile-time support for automatically selecting the most efficient data structures for a given graph analysis application assuming a consistent workload on the graph. Expand
Tracking Structure of Streaming Social Networks
A framework based on the STINGER data structure that can monitor a global property, connected components, on a graph of 16 million vertices at rates of up to 240,000 updates per second on 32 processors of a Cray XMT, opening the door to higher-level analytics such as community and anomaly detection. Expand
Performance Effects of Dynamic Graph Data Structures in Community Detection Algorithms
This work studies the problem of choosing the optimal graph representation for this community (block) graph and identifies inherent properties of the algorithm that exclude certain optimizations. Expand
Using Complex-Network Properties for Efficient Graph Analysis
This work formalizes complex-network ordering for cache misses reducing as a well known NP-Complete problem, the optimal linear arrangement problem; it proposes cn-order an heuristic that outperforms very recent graph orders, and proposes two degree-aware heuristics to solve it. Expand
Introducing Streaming into Linear Algebra-based Sparse Graph Algorithms
This paper suggests some extensions of the underlying math that would enhance GraphBLAS’ ability to stream updates into a computation without a bulk recomputation, and at greatly reduced computational complexity. Expand