Grand Challenge: Real-time Social Network Graph Analysis using StreamMine3G

Research output: Contribution to conferencesPaperContributedpeer-review

Contributors

Abstract

In this paper, we present our approach for solving the DEBS Grand Challenge 2016 using StreamMine3G, a distributed, highly scalable, elastic and fault tolerant event stream processing (ESP) system. We first provide an overview about StreamMine3G with regards to its programming model and architecture, followed by thorough description of the implementation for the two queries that provide up-to-date information about (i) the top-3 active posts and (ii) the top-k comments with the largest maximum cliques. Novel aspects of our implementation include (i) highly optimized data structures that lower the amount of lookups and traversals, and a (ii) deterministic data partitioning and processing scheme that allows the system to scale without bounds in an elastic fashion while still guaranteeing semantic transparency. In order to better utilize nowadays many-core machines, we furthermore propose a pipelining scheme in addition to data partitioning. Finally, we present a brief performance evaluation of our system.

Details

Original languageEnglish
Pages322-329
Number of pages8
Publication statusPublished - 2016
Peer-reviewedYes

Conference

Title10th ACM International Conference on Distributed and Event-based Systems
Abbreviated titleDEBS '16
Duration20 - 24 June 2016
Degree of recognitionInternational event
CityIrvine
CountryUnited States of America

External IDs

Scopus 84978698318

Keywords

Research priority areas of TU Dresden

DFG Classification of Subject Areas according to Review Boards

Keywords

  • CEP, ESP, complex event processing, event stream processing, fault tolerance, migration, scalability, state management