| Year | Title | Exploration Approach | Paper | Code |
|---|---|---|---|---|
| 2014 | Efficient subgraph matching using gpus | DFS | ||
| 2014 | Pgx. iso: parallel and efficient in-memory engine for subgraph isomorphism | BFS | ||
| 2016 | Network motif discovery: A GPU approach | BFS | ||
| 2015 | Fast subgraph matching on large graphs using graphics processors | BFS & DFS | ||
| 2018 | An Efficient Implementation of a Subgraph Isomorphism Algorithm for GPUs | DFS & BFS | ||
| 2020 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | |||
| 2020 | Fast Gunrock Subgraph Matching (GSM) on GPUs | BFS | ||
| 2020 | Gsi: Gpu-friendly subgraph isomorphism |
| Title | Paper | Code |
|---|---|---|
| Stinger: High performance data structure for streaming graphs | ||
| Llama: Efficient graph analytics using large multiversioned arrays | ||
| DISTINGER: A distributed graph data structure for massive dynamic graph processing | ||
| Graphin: An online high performance incremental graph processing framework | ||
| Time-evolving graph processing at scale | ||
| faimGraph: high performance management of fully-dynamic graphs under tight memory constraints on the GPU | ||
| Hornet: An efficient data structure for dynamic sparse graphs and matrices on gpus | ||
| GraphOne A Data Store for Real-time Analytics on Evolving Graphs | ||
| Low-latency graph streaming using compressed purely-functional trees |
| Title | Paper | Code |
|---|---|---|
| Practice of streaming and dynamic graphs: Concepts, models, systems, and parallelism |
| Title | Paper | Code |
|---|---|---|
| Size bounds and query plans for relational joins | ||
| Skew strikes back: New developments in the theory of join algorithms |
| Title | Paper | Code |
|---|---|---|
| Leapfrog triejoin: A simple, worst-case optimal join algorithm | ||
| Multipredicate join algorithms for accelerating relational graph processing on GPUs |
| Title | Paper | Code |
|---|---|---|
| Flexible caching in trie joins |
| Title | Paper | Code |
|---|---|---|
| Graphflow: An active graph database | ||
| Emptyheaded: A relational engine for graph processing | ||
| Optimizing subgraph queries by combining binary and worst-case optimal joins | ||
| Adopting worst-case optimal joins in relational database systems |