Cost-based relational query optimizer (CBO) evaluating nested loop, hash join, and sort-merge joins.
-
Updated
Sep 28, 2026 - Python
Cost-based relational query optimizer (CBO) evaluating nested loop, hash join, and sort-merge joins.
Cost-based relational query optimizer (CBO) evaluating nested loop, hash join, and sort-merge joins.
DBest is an interactive database engine designed for creating, visualizing, and executing query plans. This engine enables users to design query execution plans through an intuitive drag-and-drop interface, making it easier to understand query execution, optimize performance, and integrate diverse data sources.
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.
The system analyzes SQL queries and determines an efficient evaluation plan based on the available database schema, indexes, buffer size, and estimated operation costs. The goal is to simulate key aspects of a database query optimizer and demonstrate how different execution algorithms affect query performance.
immutable leapfrog triejoin in Clojure
Semester project of "Experimental Study on Stream Joins" at EPFL
SIGMOD Contest 2025 Winning Solution
a mini query execution engine that simulates how a database system processes queries internally using Java. It supports queries like "SELECT A.x, B.y FROM A, B WHERE A.id = B.id AND A.value > 50;".
To associate your repository with the join-algorithms topic, visit your repo's landing page and select "manage topics."