Database Paper Browser

Back to papers

Wander Join: Online Aggregation for Joins

Summary: Wander Join proposes random-walk online aggregation for joins, replacing costly ripple-join methods and relaxing order constraints. It traverses the join graph with random walks to yield continuous, approximate results, with PostgreSQL implementation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5185
Venue
SIGMOD
Year
2016
Pagerank
4.4667389e-05
Overall Rank
8,689 | 39.56%
DOI
10.1145/2882903.2889413

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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
14 Online Aggregation 1997 SIGMOD 0.0010801504
7,692 Processing Top-k Join Queries 2010 VLDB 4.6761366e-05
2,275 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.1262202e-05
10,324 Towards Efficient Random-Order Enumeration for Join Queries 2026 VLDB 4.1945683e-05
1,369 Random Sampling over Joins Revisited 2018 SIGMOD 0.00012339777
3,048 Fast, Randomized Join-Order Selection — Why Use Transformations? 1994 VLDB 7.6543116e-05
8,205 PR-Join: A Non-Blocking Join Achieving Higher Early Result Rate with Statistical Guarantees 2010 SIGMOD 4.5593375e-05
12,191 Efficient Rank Join with Aggregation Constraints 2011 VLDB 4.1945683e-05
217 Ripple Joins for Online Aggregation 1999 SIGMOD 0.00033536712
943 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00015145883