Efficient Subgraph Matching on Billion Node Graphs

Understand

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.