Back to index

Randomized Algorithms for Optimizing Large Join Queries

Yannis E. Ioannidis and Younkyung Cha Kang

One-line summary: Two randomized algorithms (iterative improvement and simulated annealing), as well as a hybrid, are presented, analyzed, and measured; the hybrid scheme seems to win.

Overview/Main Points


Randomized algorithms work well for query optimization; they produce query plans that are competitive in quality with exhaustive search, but at faster rates.


Back to index