Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins (PVLDB 2019)
☆34Apr 25, 2025Updated last year
Alternatives and similar repositories for optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins
Users that are interested in optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆27Oct 31, 2022Updated 3 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆166Oct 26, 2023Updated 2 years ago
- ☆33Oct 28, 2020Updated 5 years ago
- Graphs analytics on collections of views!☆36Nov 28, 2023Updated 2 years ago
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 3 months ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- Source code and datasets of "RapidMatch: A Holistic Approach to Subgraph Query Processing", accepted by VLDB'21 - By Shixuan Sun, Xibo Su…☆37Aug 10, 2022Updated 3 years ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆32Jun 30, 2022Updated 3 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Dec 4, 2019Updated 6 years ago
- Codes of the paper "Time Constrained Continuous Subgraph Search Over Streaming Graphs. ICDE 2019: 1082-1093". Authors: Youhuan Li, Lei Zo…☆12Jun 18, 2021Updated 4 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆15Mar 28, 2020Updated 6 years ago
- An implementation of Ngo et al's GenericJoin in timely dataflow.☆92Apr 3, 2019Updated 7 years ago
- Your worst case is our best case.☆145Mar 15, 2017Updated 9 years ago
- ☆28Jan 5, 2022Updated 4 years ago
- ☆20Dec 27, 2021Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- PVLDB LaTeX style, based on acmart☆15Apr 29, 2021Updated 5 years ago
- Hosting the binary files and configurations for running patmat benchmarking. This corresponds to a vldb experiment paper published recent…☆11Sep 28, 2019Updated 6 years ago
- Labelled Subgraph Query Benchmark – A lightweight benchmark suite focusing on subgraph matching queries. Note: This is a microbenchmark f…☆40Apr 6, 2026Updated last month
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆31Jan 23, 2019Updated 7 years ago
- ☆16Apr 2, 2024Updated 2 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Jun 11, 2021Updated 4 years ago
- ☆10Jan 7, 2019Updated 7 years ago
- Source code and datasets of "Efficient GPU-Accelerated Subgraph Matching", accepted by SIGMOD'23 - By Xibo Sun and Prof. Qiong Luo☆20Jul 20, 2023Updated 2 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆37Jul 30, 2025Updated 9 months ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Incremental view maintenance for openCypher graph queries.☆48Mar 18, 2019Updated 7 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…☆27Aug 15, 2021Updated 4 years ago
- ☆13Dec 27, 2016Updated 9 years ago
- Reproducibility package for "Robust Join Processing with Diamond Hardened Joins"☆12Jul 10, 2024Updated last year
- Hosting the code and scripts for benchmarking 4 graph databases - Neo4j, AgensGraph, LightGraph, and TigerGraph☆23Jan 2, 2024Updated 2 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆26Sep 22, 2015Updated 10 years ago
- ☆25Jan 2, 2021Updated 5 years ago
- A subgraph enumeration framework☆14Oct 20, 2017Updated 8 years ago
- The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Wor…☆18Oct 18, 2020Updated 5 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Jun 24, 2019Updated 6 years ago
- GBBS: Graph Based Benchmark Suite☆225Apr 12, 2026Updated last month
- ☆12May 29, 2024Updated last year
- Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together☆71Feb 18, 2022Updated 4 years ago
- Reference implementations for LDBC Social Network Benchmark's Interactive workload.☆112Mar 26, 2026Updated 2 months ago
- SkinnerDB is an analytical database management system. It uses adaptive processing and reinforcement learning to find near-optimal join o…☆54Mar 3, 2024Updated 2 years ago
- Cypher query execution framework☆26Jul 11, 2025Updated 10 months ago