Name
Title | ||
|---|---|---|
DIMSpan - Transactional Frequent Subgraph Mining with Distributed In-Memory Dataflow Systems. |
Abstract | ||
|---|---|---|
Transactional frequent subgraph mining identifies frequent structural patterns in a collection of graphs. This research problem has wide applicability and increasingly requires higher scalability over single machine solutions to address the needs of Big Data use cases. We introduce DIMSpan, an advanced approach to frequent subgraph mining that utilizes the features provided by distributed in-memory dataflow systems such as Apache Flink or Apache Spark. It determines the complete set of frequent subgraphs from arbitrary string-labeled directed multigraphs as they occur in social, business and knowledge networks. DIMSpan is optimized to runtime and minimal network traffic but memory-aware. An extensive performance evaluation on large graph collections shows the scalability of DIMSpan and the effectiveness of its optimization techniques. |
Year | Venue | DocType |
|---|---|---|
2017 | BDCAT | Conference |
Volume | Citations | PageRank |
abs/1703.01910 | 3 | 0.37 |
References | Authors | |
25 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| André Petermann | 1 | 51 | 6.17 |
| Martin Junghanns | 2 | 50 | 5.48 |
| Erhard Rahm | 3 | 7415 | 655.09 |