VertexSurge: Variable Length Graph Pattern Match on Billion-edge Graphs

The authors' abstract

This is the paper's own summary, in the paper's own words. It is dense on purpose — abstracts are written to compress.

Variable-Length Graph Pattern Matching (VLGPM) is a critical functionality in graph databases, pivotal for identifying patterns where the number of connecting edges between two matched vertices is variable. This function plays a vital role in analyzing complex and dynamic networks such as social networks or bank transfers networks, where relationships can vary extensively in both length and structure. However, despite its importance, current graph databases, optimized primarily for single-hop subgraph matching, struggle with VLGPM over large graphs.