H20Zhang / Crystal
Crystal is a novel method for distributed subgraph matching on very large graphs. Crystal outperforms existing methods by several orders of magnitude on very large graphs. The work was published on VLDB 2018 with title "Subgraph matching: on compression and computation".
☆11Updated 6 years ago
Alternatives and similar repositories for Crystal:
Users that are interested in Crystal are comparing it to the libraries listed below
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆34Updated 9 months ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆32Updated 4 years ago
- Dynamic data structure for sparse graphs.☆30Updated 11 months ago
- ☆27Updated 2 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 5 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆29Updated 9 years ago
- ☆29Updated 4 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆154Updated last year
- ☆28Updated 6 months ago
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆49Updated 2 years ago
- ☆17Updated 3 months ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- ☆17Updated 3 years ago
- Source code of "ThunderRW: An In-Memory Graph Random Walk Engine" published in VLDB'2021 - By Shixuan Sun, Yuhang Chen, Shengliang Lu, Bi…☆26Updated 3 years ago
- ☆35Updated 5 years ago
- ☆10Updated 10 months ago
- ☆24Updated 2 years ago
- Graph Pattern Mining☆87Updated 6 months ago
- ☆40Updated 3 years ago
- An active graph database.☆16Updated 7 years ago
- Transforming Graphs for Efficient Irregular Graph Processing on GPUs☆47Updated 2 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆14Updated 2 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- Linked Stream Benchmark☆13Updated 2 years ago
- ☆18Updated 3 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆11Updated 3 years ago
- C++ driver to evaluate updates in dynamic structural graphs☆16Updated 2 years ago
- G3: A Programmable GNN Training System on GPU☆43Updated 4 years ago