Longbin Lai

Longbin Lai

Bonjour, je suis robin et je suis un ordinateur populaire. C'est La vie.

Distributed Subgraph Matching on Timely Dataflow [Experiments and Analyses]

Published in VLDB 2019 (to appear), 2019

This paper systematically compares the existing works on distributed subgraph matching algorithms in the literature. It summarizes the literature into four strategies: BinJoin (binary-join-based subgraph growing algorithms), WOptJoin (worst-case optimal vertex growing algorithms), ShrCube (Sharing of Hypercubes) and FulRep (Full replica of graph data in each machine). We are currently working on open sourcing the codes. Please stay tuned!

Download here

Scalable Subgraph Enumeration in MapReduce

Published in PVLDB 8(10), 2017

This paper studied the subgraph enumeration problem using MapReduce. In this paper, a special structure called TwinTwig has been used in the left-deep join structure and proven to be instance-optimal compared to the traditional join based on star. The source code can be forked from my GitHub pages.

Download here