PatMat: A Distributed Pattern Matching Engine with Cypher

RAIDS Lab Authors

Zhengyi Yang

Director

Details

Research Area

Tags

Resources

Abstract

Graph pattern matching is one of the most fundamental problems in graph database and is associated with a wide spectrum of applications. Due to its computational intensiveness, researchers have primarily devoted their efforts to improving the performance of the algorithm while constraining the graphs to have singular labels on vertices (edges) or no label. Whereas in practice graphs are typically associated with rich properties, thus the main focus in the industry is instead on powerful query languages that can express a sufficient number of pattern matching scenarios. We demo PatMat in this work to glue together the academic efforts on performance and the industrial efforts on expressiveness. To do so, we leverage the state-of-the-art join-based algorithms in the distributed contexts and Cypher query language - the most widely-adopted declarative language for graph pattern matching. The experiments demonstrate how we are capable of turning complex Cypher semantics into a distributed solution with high performance.

Author Affiliations

@inproceedings{hao2019patmat,
  title = {PatMat: A Distributed Pattern Matching Engine with Cypher},
  author = {Hao, Kongzhang and Yang, Zhengyi and Lai, Longbin and Lai, Zhengmin and Jin, Xin and Lin, Xuemin},
  series = {CIKM '19},
  url = {http://dx.doi.org/10.1145/3357384.3357840},
  doi = {10.1145/3357384.3357840},
  booktitle = {Proceedings of the 28th ACM International Conference on Information and Knowledge Management},
  publisher = {ACM},
  year = {2019},
  month = Nov,
  pages = {2921-2924},
  collection = {CIKM '19}
}