786 citations · 3k across the 61 of their papers we have counts for
Showing 2013 · cs.DBShow all
2 papers · 2 filters
cs.DB2013★ 23 cited
Skew Strikes Back: New Developments in the Theory of Join Algorithms
Hung Q. Ngo, Christopher Re, Atri Rudra
Evaluating the relational join is one of the central algorithmic and most well-studied problems in database systems. A staggering number of variants have been considered including…
cs.DB2013
Beyond Worst-Case Analysis for Joins with Minesweeper
Hung Q. Ngo, Dung T. Nguyen, Christopher Ré +1
We describe a new algorithm, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially, `beyond worst-case guarantees') for data…