In-memory subgraph matching: An in-depth study
We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …
[PDF][PDF] In-Memory Subgraph Matching: An In-depth Study
S Sun, Q Luo - 2020 - shixuansun.github.io
Subgraph matching finds all embeddings in a data graph G that are isomorphic to a query
graph q where both G and q are labeled graphs. For example, given the graphs in Figure …
graph q where both G and q are labeled graphs. For example, given the graphs in Figure …
In-Memory Subgraph Matching: An In-depth Study
S Sun, Q Luo - SIGMOD'20: Proceedings of the 2020 ACM …, 2020 - repository.ust.hk
We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …
[PDF][PDF] In-Memory Subgraph Matching: An In-depth Study
S Sun, Q Luo - shixuansun.github.io
➢ Query graphs are randomly extracted from the data graph.➢ Each query set contains 200
connected graphs with the same number of vertices.➢ 𝑄 and 𝑄 denote dense (𝑑 (𝑞)≥ 3) …
connected graphs with the same number of vertices.➢ 𝑄 and 𝑄 denote dense (𝑑 (𝑞)≥ 3) …