A repository for benchmarking Optimistic Order-Preserving Hash Join (OOHJ) in MySQL using the Join Order Benchmark (JOB). Part of a Master’s thesis project, it includes scripts for setting up the database, running SQL queries, and evaluating performance.
C++ hash join pipeline for the SIGMOD 2025 Programming Contest. Robin Hood, Hopscotch, Cuckoo and Unchained hash tables over a column store with late materialization, plus parallel build and probing with work stealing. Around 16x faster than the std::unordered_map baseline.
Add a description, image, and links to the join-order-benchmark topic page so that developers can more easily learn about it.
To associate your repository with the join-order-benchmark topic, visit your repo's landing page and select "manage topics."