| 321 |
Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems |
2018 |
PODS |
0.00021283186 |
| 530 |
An Analytical Study of Large SPARQL Query Logs |
2018 |
VLDB |
0.0001709169 |
| 809 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00013874588 |
| 814 |
Hypertree Decompositions: Questions and Answers |
2016 |
PODS |
0.00013841737 |
| 1,237 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00011545768 |
| 1,246 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
0.00011504088 |
| 1,549 |
AJAR: Aggregations and Joins over Annotated Relations |
2016 |
PODS |
0.00010390168 |
| 1,740 |
Adopting Worst-Case Optimal Joins in Relational Database Systems |
2020 |
VLDB |
9.875587e-05 |
| 2,035 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
9.2787188e-05 |
| 2,060 |
Traversing Large Graphs on GPUs with Unified Memory |
2020 |
VLDB |
9.2454783e-05 |
| 2,112 |
Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions |
2018 |
SIGMOD |
9.1514258e-05 |
| 2,126 |
Kuzu* Graph Database Management System |
2023 |
CIDR |
9.1329991e-05 |
| 2,182 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
9.010121e-05 |
| 2,190 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
8.9804702e-05 |
| 2,769 |
A Layered Aggregate Engine for Analytics Workloads |
2019 |
SIGMOD |
8.1465406e-05 |
| 2,854 |
Extracting and Analyzing Hidden Graphs from Relational Databases |
2017 |
SIGMOD |
8.0350257e-05 |
| 2,915 |
GraphScope: A Unified Engine For Big Graph Processing |
2021 |
VLDB |
7.9666977e-05 |
| 3,027 |
Sortledton: a Universal, Transactional Graph Data Structure |
2022 |
VLDB |
7.8374092e-05 |
| 3,102 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
7.7568687e-05 |
| 3,194 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
7.6491858e-05 |
| 3,283 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
7.56675e-05 |
| 3,821 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
7.0933895e-05 |
| 3,872 |
All-in-One: Graph Processing in RDBMSs Revisited |
2017 |
SIGMOD |
7.0580243e-05 |
| 3,941 |
Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins |
2023 |
PODS |
7.0074268e-05 |
| 4,128 |
The Relational Data Borg is Learning |
2020 |
VLDB |
6.8850804e-05 |
| 4,158 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.8628196e-05 |
| 4,753 |
Worst-Case Optimal Graph Joins in Almost No Space |
2021 |
SIGMOD |
6.5231863e-05 |
| 4,892 |
Fast In-Memory SQL Analytics on Typed Graphs |
2017 |
VLDB |
6.4574091e-05 |
| 4,983 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
6.4127092e-05 |
| 5,275 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
6.2873652e-05 |
| 5,321 |
High-Performance Row Pattern Recognition Using Joins |
2023 |
VLDB |
6.2659937e-05 |
| 5,364 |
Fast Join Project Query Evaluation using Matrix Multiplication |
2020 |
SIGMOD |
6.2472125e-05 |
| 5,376 |
Evolution of a Compiling Query Engine |
2021 |
VLDB |
6.2415397e-05 |
| 5,461 |
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings |
2019 |
PODS |
6.2090515e-05 |
| 5,529 |
Debunking the Myth of Join Ordering: Toward Robust SQL Analytics |
2025 |
SIGMOD |
6.18591e-05 |
| 5,601 |
Optimal Join Algorithms Meet Top-k |
2020 |
SIGMOD |
6.1540123e-05 |
| 5,781 |
Free Join: Unifying Worst-Case Optimal and Traditional Joins |
2023 |
SIGMOD |
6.0910397e-05 |
| 5,870 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
6.061038e-05 |
| 5,938 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
6.0343238e-05 |
| 6,149 |
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding |
2024 |
VLDB |
5.9581422e-05 |
| 6,159 |
General and Fractional Hypertree Decompositions: Hard and Easy Cases |
2018 |
PODS |
5.9542729e-05 |
| 6,325 |
Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation |
2021 |
SIGMOD |
5.9125893e-05 |
| 6,387 |
Modern Techniques for Querying Graph-Structured Relations: Foundations, System Implementations, and Open Challenges |
2022 |
VLDB |
5.8896555e-05 |
| 6,393 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
5.8879832e-05 |
| 6,434 |
Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees |
2025 |
SIGMOD |
5.8799421e-05 |
| 6,456 |
LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR |
2024 |
SIGMOD |
5.8741786e-05 |
| 6,514 |
A Relational Matrix Algebra and its Implementation in a Column Store |
2020 |
SIGMOD |
5.8559163e-05 |
| 6,585 |
JoinBoost: Grow Trees Over Normalized Data Using Only SQL |
2023 |
VLDB |
5.8350362e-05 |
| 6,924 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
5.738697e-05 |
| 6,961 |
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra |
2021 |
VLDB |
5.7303405e-05 |