Wander Join: Online Aggregation via Random Walks
Summary: Wander Join uses random walks over the join graph for online aggregation, beating ripple join without precomputed statistics. Statistics-free optimizer selects walk-based plans; strong for multi-table equality and group-by, validated on TPC-H in PostgreSQL. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Feifei Li
- 2. Bin Wu
- 3. Ke Yi
- 4. Zhuoyue Zhao
Incoming Citations (Sorted by Pagerank)
Showing 18 of 68 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 30 of 30 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,680 | A Practical Approach to Groupjoin and Nested Aggregates | 2021 | VLDB | 4.4694927e-05 |
| 1,369 | Random Sampling over Joins Revisited | 2018 | SIGMOD | 0.00012339777 |
| 10,324 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB | 4.1945683e-05 |
| 12,191 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB | 4.1945683e-05 |
| 2,275 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.1262202e-05 |
| 2,202 | A Scalable Hash Ripple Join Algorithm | 2002 | SIGMOD | 9.2987417e-05 |
| 8,205 | PR-Join: A Non-Blocking Join Achieving Higher Early Result Rate with Statistical Guarantees | 2010 | SIGMOD | 4.5593375e-05 |
| 3,048 | Fast, Randomized Join-Order Selection — Why Use Transformations? | 1994 | VLDB | 7.6543116e-05 |
| 217 | Ripple Joins for Online Aggregation | 1999 | SIGMOD | 0.00033536712 |
| 8,689 | Wander Join: Online Aggregation for Joins | 2016 | SIGMOD | 4.4667389e-05 |