Asynchronous Graph Pattern Matching on Multiprocessor Systems

Alexander KrauseAlexander Krause, Thomas KissingerThomas Kissinger, Dirk HabichDirk Habich, Wolfgang LehnerWolfgang Lehner

Alexander Krause, Thomas Kissinger, Dirk Habich, Wolfgang Lehner
Asynchronous Graph Pattern Matching on Multiprocessor Systems
21st European Conference on Advances in Databases and Information Systems, Nicosia, Cyprus, to appear

Details
Bibtex

KurzfassungAbstract
Pattern matching on large graphs is the foundation for a variety of application domains. Strict latency requirements and continuously increasing graph sizes demand the usage of highly parallel in-memory graph processing engines that need to consider non-uniform memory access (NUMA) and concurrency issues to scale up on modern multiprocessor systems. To tackle these aspects, graph partitioning becomes increasingly important. Hence, we present a technique to process graph pattern matching on NUMA systems in this paper. As a scalable pattern matching processing infrastructure, we leverage a data-oriented architecture that preserves data locality and minimizes concurrency-related bottlenecks on NUMA systems. We show in detail, how graph pattern matching can be asynchronously processed on a multiprocessor system.
Projekt:Project: HAEC B08
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@inproceedings{KKHL2017,
  author    = {Alexander Krause and Thomas Kissinger and Dirk Habich and
               Wolfgang Lehner},
  title     = {Asynchronous Graph Pattern Matching on Multiprocessor Systems},
  booktitle = {21st European Conference on Advances in Databases and Information
               Systems, Nicosia, Cyprus},
  year      = {2017},
  month     = {September}
}