82 citations · 208 across the 20 of their papers we have counts for
4 papers · 1 filter
Graph Sampling with Distributed In-Memory Dataflow Systems
Kevin Gomez, Matthias Täschner, M. Ali Rostami +2
Given a large graph, a graph sample determines a subgraph with similar characteristics for certain metrics of the original graph. The samples are much smaller thereby accelerating…
Load Balancing for MapReduce-based Entity Resolution
Lars Kolb, Andreas Thor, Erhard Rahm
The effectiveness and scalability of MapReduce-based implementations of complex data-intensive tasks depend on an even redistribution of data between map and reduce tasks. In the p…
Parallel Sorted Neighborhood Blocking with MapReduce
Lars Kolb, Andreas Thor, Erhard Rahm
Cloud infrastructures enable the efficient parallel execution of data-intensive tasks such as entity resolution on large datasets. We investigate challenges and possible solutions…
Data Partitioning for Parallel Entity Matching
Toralf Kirsten, Lars Kolb, Michael Hartung +3
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity match…