RapidsAtHKUST / ContinuousSubgraphMatchingLinks
Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof. Qiong Luo, and Prof. Bingsheng He
☆50Updated 2 years ago
Alternatives and similar repositories for ContinuousSubgraphMatching
Users that are interested in ContinuousSubgraphMatching are comparing it to the libraries listed below
Sorting:
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆160Updated 2 years ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆32Updated 3 years ago
- The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"☆14Updated last year
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 3 years ago
- ☆15Updated 6 months ago
- ☆27Updated 2 years ago
- A Distributed System for GNN Training☆124Updated last year
- Source code and datasets of "RapidMatch: A Holistic Approach to Subgraph Query Processing", accepted by VLDB'21 - By Shixuan Sun, Xibo Su…☆33Updated 3 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆32Updated 10 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 6 months ago
- ☆18Updated 4 years ago
- Graph Partitioning for Large-scale Graph Datasets☆97Updated 3 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- Source codes of "Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction", SIGMOD 2023☆14Updated 2 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆32Updated 4 years ago
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years ago
- ☆14Updated 4 years ago
- A collection of awesome papers about graph processing.☆15Updated 6 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆134Updated last month
- ☆12Updated last year
- ☆12Updated last year
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Graph edge partitioning algorithms☆47Updated 6 years ago
- ☆31Updated 5 years ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆143Updated 2 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- ☆12Updated 3 years ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆35Updated 3 months ago