| 6,826 |
Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores |
2025 |
VLDB |
5.6566963e-05 |
| 7,126 |
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra |
2021 |
VLDB |
5.580601e-05 |
| 7,394 |
ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement Learning |
2023 |
VLDB |
5.5202266e-05 |
| 7,552 |
Fast Local Subgraph Counting |
2024 |
VLDB |
5.4802093e-05 |
| 7,557 |
HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs |
2024 |
SIGMOD |
5.4795245e-05 |
| 7,888 |
Mind the Gap: Bridging Multi-Domain Query Workloads with EmptyHeaded |
2017 |
VLDB |
5.4161029e-05 |
| 7,936 |
Avoiding Materialisation for Guarded Aggregate Queries |
2025 |
VLDB |
5.4070923e-05 |
| 8,048 |
Dependency-Driven Analytics: a Compass for Uncharted Data Oceans |
2017 |
CIDR |
5.3842397e-05 |
| 8,348 |
Revisiting the Design of In-Memory Dynamic Graph Storage |
2025 |
SIGMOD |
5.3337901e-05 |
| 8,508 |
Optimizing Declarative Graph Queries at Large Scale |
2019 |
SIGMOD |
5.3124867e-05 |
| 8,517 |
SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries |
2020 |
SIGMOD |
5.3110227e-05 |
| 8,871 |
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth |
2022 |
PODS |
5.2460913e-05 |
| 8,899 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
5.2401722e-05 |
| 9,047 |
Optimizing Parallel Recursive Datalog Evaluation on Multicore Machines |
2022 |
SIGMOD |
5.2168077e-05 |
| 9,179 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
5.1992749e-05 |
| 9,684 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
5.1258854e-05 |
| 9,843 |
RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries |
2025 |
VLDB |
5.1064323e-05 |
| 9,881 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
5.1043481e-05 |
| 9,882 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
5.1043481e-05 |
| 9,991 |
HoneyComb: A Parallel Worst-Case Optimal Join on Multicores |
2025 |
SIGMOD |
5.0845476e-05 |
| 10,101 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
5.068372e-05 |
| 10,111 |
Pensieve: Skewness-Aware Version Switching for Efficient Graph Processing |
2020 |
SIGMOD |
5.0669183e-05 |
| 10,168 |
A Modular Graph-Native Query Optimization Framework |
2025 |
SIGMOD |
5.0559291e-05 |
| 10,289 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
5.031399e-05 |
| 10,303 |
GraphMatch: Subgraph Query Processing on Steroids |
2026 |
SIGMOD |
5.0294306e-05 |
| 10,379 |
Algebraic Subgraph Counting |
2027 |
SIGMOD |
4.9605343e-05 |
| 10,435 |
I Can't Believe It's Not Yannakakis: Pragmatic Bitmap Filters in Microsoft SQL Server |
2026 |
CIDR |
4.9605343e-05 |
| 10,476 |
The Space-Time Complexity of Sum-Product Queries |
2026 |
PODS |
4.9605343e-05 |
| 10,498 |
Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching |
2026 |
SIGMOD |
4.9605343e-05 |
| 10,529 |
Factorized and Vectorized Execution: Optimizing Analytical and Semantic Queries over Relations |
2026 |
SIGMOD |
4.9605343e-05 |
| 10,663 |
Query Optimization for Database-Returning Queries |
2026 |
SIGMOD |
4.9605343e-05 |
| 10,689 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
4.9605343e-05 |
| 10,710 |
Enabling Efficient Direct Update on Rule-Based Compressed Graph |
2026 |
SIGMOD |
4.9605343e-05 |
| 10,781 |
TurboLynx: Schemaless Graph Engine Strikes Back for General-Purpose Analytics |
2026 |
VLDB |
4.9605343e-05 |
| 10,839 |
One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans |
2026 |
VLDB |
4.9605343e-05 |
| 10,859 |
Subgraph Enumeration: Beyond Tree Decomposition |
2026 |
VLDB |
4.9605343e-05 |
| 10,873 |
BaCon: Efficient Batch Processing of Counting Queries |
2026 |
VLDB |
4.9605343e-05 |
| 10,924 |
Worst-Case Optimal BGPs on Temporal Graphs |
2026 |
VLDB |
4.9605343e-05 |
| 11,253 |
Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized |
2025 |
SIGMOD |
4.9605343e-05 |
| 11,270 |
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns |
2025 |
SIGMOD |
4.9605343e-05 |
| 11,601 |
Towards a Converged Relational-Graph Optimization Framework |
2024 |
SIGMOD |
4.9605343e-05 |
| 11,708 |
A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition |
2024 |
VLDB |
4.9605343e-05 |
| 11,785 |
Lightweight Materialization for Fast Dashboards Over Joins |
2023 |
SIGMOD |
4.9605343e-05 |
| 11,856 |
Demonstrating ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Joins via Reinforcement Learning |
2023 |
VLDB |
4.9605343e-05 |
| 12,034 |
Vertex-centric Parallel Computation of SQL Queries |
2021 |
SIGMOD |
4.9605343e-05 |
| 12,171 |
Towards Multi-way Join Aware Optimizer in SAP HANA |
2020 |
VLDB |
4.9605343e-05 |
| 12,335 |
Graph Data Mining with Arabesque |
2017 |
SIGMOD |
4.9605343e-05 |