Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Efficient Subgraph Matching on Billion Node Graphs

Zhao Sun, Hongzhi Wang, Bin Shao, Haixun Wang, and Jianzhong Li

Abstract

The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, reachability, regular expression matching, etc. In many cases, graph indices are employed to speed up query processing. Typically, most indices require either super-linear indexing time or super-linear indexing space. Unfortunately, for very large graphs, super-linear approaches are almost always infeasible. In this paper, we study the problem of subgraph matching on billion-node graphs. We present a novel algorithm that supports efficient subgraph matching for graphs deployed on a distributed memory store. Instead of relying on super-linear indices, we use efficient graph exploration and massive parallel computing for query processing. Our experiment results demonstrate the feasibility of performing subgraph matching on web-scale graph data.

Details

Publication typeInproceedings
Published inPVLDB
> Publications > Efficient Subgraph Matching on Billion Node Graphs