Fast, Randomized Join-Order Selection — Why Use Transformations?
Summary: Transformation-free join-order search: select uniformly random evaluation orders from acyclic query spaces instead of applying tree-transformations. Efficient generation of random candidates and accurate cost estimates yield faster convergence with competitive costs vs iterative improvement and simulated annealing. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 979 | Rapid Bushy Join-order Optimization with Cartesian Products | 1996 | SIGMOD | 0.00014871114 |
| 1,212 | RDF-3X: a RISC-style Engine for RDF | 2008 | VLDB | 0.00013255692 |
| 2,407 | Scalable Join Processing on Very Large RDF Graphs | 2009 | SIGMOD | 8.8702781e-05 |
| 3,407 | EROC: A Toolkit for Building NEATO Query Optimizers | 1996 | VLDB | 7.1253175e-05 |
| 4,734 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9553181e-05 |
| 6,218 | Charting the Design Space of Query Execution using VOILA | 2021 | VLDB | 5.1462707e-05 |
| 8,477 | Excalibur: A Virtual Machine for Adaptive Fine-grained JIT-Compiled Query Execution based on VOILA | 2023 | VLDB | 4.4971772e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 388 | Optimization of Large Join Queries | 1988 | SIGMOD | 0.00024654816 |
| 400 | Randomized Algorithms For Optimizing Large Join Queries | 1990 | SIGMOD | 0.00024308369 |
| 422 | Measuring the Complexity of Join Enumeration in Query Optimization | 1990 | VLDB | 0.00023654556 |
| 569 | Query Optimization by Simulated Annealing | 1987 | SIGMOD | 0.00019912758 |
| 782 | Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques | 1989 | SIGMOD | 0.00016665859 |
| 811 | Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization | 1991 | SIGMOD | 0.00016385568 |
| 2,771 | On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces | 1993 | VLDB | 8.149365e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,334 | Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins | 2019 | VLDB | 0.00012543633 |
| 4,526 | Simplicity Done Right for Join Ordering | 2021 | CIDR | 6.1079584e-05 |
| 4,734 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD | 5.9553181e-05 |
| 3,386 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS | 7.151562e-05 |
| 1,372 | Random Sampling over Joins Revisited | 2018 | SIGMOD | 0.0001233325 |
| 18 | On Random Sampling over Joins | 1999 | SIGMOD | 0.00092569117 |
| 388 | Optimization of Large Join Queries | 1988 | SIGMOD | 0.00024654816 |
| 10,336 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB | 4.1905499e-05 |
| 8,720 | A Fast Randomized Algorithm for Multi-Objective Query Optimization | 2016 | SIGMOD | 4.4563359e-05 |
| 400 | Randomized Algorithms For Optimizing Large Join Queries | 1990 | SIGMOD | 0.00024308369 |