CockroachDB has made significant strides in optimizing SQL joins since its initial implementation, aiming to improve performance as it approaches the release of version 1.0. Initially offering a basic proof of concept, the database now employs hash joins to replace the previous nested loop approach, resulting in a linear speedup for most cases. This change reduces time complexity and enhances efficiency, particularly for equijoins, and also introduces selection propagation to optimize query filters by applying them before joins, reducing the computational load. Additionally, CockroachDB has implemented an elision of unused columns to further improve performance by minimizing unnecessary data handling. While outer joins remain a challenge, the database is progressing towards distributed query execution, allowing for parallel processing across multiple nodes, potentially accelerating join operations significantly. Although the optimizations are still in preliminary stages, they promise improved performance for simple join queries, and ongoing efforts focus on more sophisticated optimizations, such as join reordering based on indices and data cardinality. The CockroachDB team is eager to gather user feedback and continues to refine its capabilities to meet enterprise-grade performance standards.