19 citations · 24 across the 2 of their papers we have counts for
2 papers
cs.DB2017★ 5 cited
DIMSpan - Transactional Frequent Subgraph Mining with Distributed In-Memory Dataflow Systems
André Petermann, Martin Junghanns, Erhard Rahm
Transactional frequent subgraph mining identifies frequent subgraphs in a collection of graphs. This research problem has wide applicability and increasingly requires higher scalab…
cs.DB2015★ 19 cited
GRADOOP: Scalable Graph Data Management and Analytics with Hadoop
Martin Junghanns, André Petermann, Kevin Gómez +1
Many Big Data applications in business and science require the management and analysis of huge amounts of graph data. Previous approaches for graph analytics such as graph database…