Tagged articles
Join Algorithms
16 articles · Page 1 of 1
This article explains how Hash Join assigns build and probe sides, why the smaller table typically becomes the build side, how outer joins affect side selection, and the differences from Sort-Merge Join, with a concrete SQL example.
Build SideDatabase InternalsHash Join
0 likes · 6 min read

This article walks through a real‑world MySQL slow‑query case, explains the inner workings of Join and Order by algorithms, shows how to interpret EXPLAIN and Optimizer_trace output, and demonstrates how adding an index can transform a costly Block Nested‑Loop Join into a fast Index Nested‑Loop Join, dramatically improving performance.
EXPLAINJoin AlgorithmsMySQL
0 likes · 13 min read

This article walks through a real-world slow‑SQL case, explains the inner workings of Join and Order‑by algorithms, demonstrates using EXPLAIN and optimizer_trace to trace execution, and shows how adding indexes and choosing the right join method can dramatically improve MySQL query performance.
EXPLAINJoin AlgorithmsMySQL
0 likes · 12 min read

This article thoroughly examines MySQL join operations, detailing the fundamentals, inner workings, and performance characteristics of Nested‑Loop Join, Block Nested‑Loop Join, and Hash Join, while providing practical optimization techniques, parameter tuning, and decision‑making guidance for different data sizes and query patterns.
Block Nested Loop JoinDatabase PerformanceHash Join
0 likes · 11 min read

This article explains how multi‑table joins in MySQL can become performance bottlenecks and walks through the four join algorithms—Simple Nested‑Loop, Block Nested‑Loop, Hash, and Index Nested‑Loop—showing their execution plans, code examples, and step‑by‑step optimizations using indexes and join buffers to dramatically improve query speed.
Join AlgorithmsSQL Optimizationdatabase
0 likes · 19 min read

This article explores MySQL's join processing methods—Simple Nested‑Loop, Block Nested‑Loop, Hash, and Index Nested‑Loop joins—demonstrates how to create test tables, analyze execution plans, and apply practical optimizations such as indexing and query rewriting to dramatically improve multi‑table query performance.
Database PerformanceJoin AlgorithmsMySQL
0 likes · 21 min read

This article explains how MySQL processes multi‑table joins, compares Simple Nested‑Loop, Block Nested‑Loop, Hash, and Index Nested‑Loop join algorithms, and demonstrates practical optimization techniques using indexes, join buffers, and query rewrites to dramatically improve performance on large datasets.
Database PerformanceJoin AlgorithmsSQL Optimization
0 likes · 20 min read

This article explains MySQL's hash join algorithm, compares it with nested‑loop joins, shows how to read execution steps and EXPLAIN output, discusses extended hash‑join scenarios, and weighs the trade‑offs of performing multi‑table joins inside the database versus in application code.
Hash JoinJoin AlgorithmsMySQL
0 likes · 8 min read

This article uses a realistic interview scenario to explore why multi-table joins in MySQL are not inherently slow, detailing four join algorithms—simple nested-loop, index nested-loop, block nested-loop, and batched key access—along with their pseudo‑code, execution steps, performance trade‑offs, and the impact of features like MRR and recent optimizer changes.
Index JoinJoin AlgorithmsMySQL
0 likes · 10 min read

The article explains Presto’s join processing by detailing the business need to limit multi‑table joins, then describing nested‑loop, sort‑merge, and hash join algorithms with Java examples, and finally showing how the Volcano model, columnar pages, and planner integration enable scalable, efficient OLAP join execution.
Hash JoinJoin AlgorithmsSQL
0 likes · 17 min read

The article explores MySQL's Hash Join algorithms, comparing Basic, On-disk, Grace, and Hybrid variants, while detailing rule-based optimizer decisions, memory management, disk spilling mechanisms, and outer join execution strategies through source code analysis.
Hash JoinJoin AlgorithmsMySQL
0 likes · 21 min read

Learn how MySQL 8’s hash join algorithm works by building an in‑memory hash table from the smaller table, probing the larger table for matches, and handling oversized tables through disk‑based chunk files, offering a more efficient alternative to traditional nested‑loop joins.
Hash JoinJoin AlgorithmsMySQL
0 likes · 5 min read

This article explains how MySQL 8.0.18 introduces the hash join algorithm, describes its build and probe phases, disk‑overflow handling, usage instructions, optimizer switches, performance comparisons with block nested loops, and current limitations, providing code examples and practical guidance.
Hash JoinJoin AlgorithmsMySQL
0 likes · 9 min read

This article explains SparkSQL's three join strategies—Shuffle Hash Join, Broadcast Hash Join, and Sort Merge Join—detailing their mechanisms, when to use each based on table size, and their relative performance costs in distributed big‑data environments.
Broadcast JoinHash JoinJoin Algorithms
0 likes · 5 min read

This article explains the principles, use cases, and performance considerations of Spark SQL's three join implementations—Broadcast Hash Join, Shuffle Hash Join, and Sort‑Merge Join—illustrating how table size and distribution affect the choice of algorithm for efficient large‑scale data processing.
Broadcast JoinJoin AlgorithmsShuffle Join
0 likes · 11 min read

Meituan‑Dianping’s Dashiang Cube is a multi‑source BI reporting platform that unifies MySQL, Kylin, Elasticsearch and plain‑text data via a common SQL layer, generates dialect‑specific queries, performs custom back‑tracking inner and left outer joins across heterogeneous sources, supports scripted metric calculations, permission controls, and a reusable UI component library for self‑service reporting.
BIJavaJoin Algorithms
0 likes · 14 min read
