0Pricing
PostgreSQL Performance & Query Optimization · Aula

Entendendo os algoritmos de junção

Explore como o PostgreSQL executa diferentes tipos de junção: Loop Aninhado, Junção por Hash e Junção por Mesclagem.

Entendendo os algoritmos de junção é uma aula grátis de PostgreSQL Performance & Query Optimization no CoddyKit. Esta é a aula 1 de 4. Você pode ler a aula completa abaixo gratuitamente — depois pratica ao vivo no navegador com um editor de código integrado e um tutor de IA 24/7. Faz parte do caminho de aprendizado de PostgreSQL Performance & Query Optimization, e seu progresso é sincronizado entre a web e o app CoddyKit. O curso de PostgreSQL Performance & Query Optimization inclui 4 aulas no total.

Partes desta aula ainda não foram traduzidas e aparecem em inglês.

Joins: Connecting Data

Welcome to understanding PostgreSQL join algorithms! Joins are fundamental for combining data from multiple tables.

They allow you to retrieve related information that is spread across your database schema, forming a complete picture.

Beyond Basic Joins

When you write a JOIN clause, PostgreSQL doesn't just pick one way to execute it. It has several powerful algorithms at its disposal.

The database's query planner chooses the most efficient algorithm based on factors like table size, available indexes, and data distribution.

Nested Loop Join Basics

The Nested Loop Join (NLJ) is the simplest algorithm. It works like a nested 'for' loop:

  • For each row in the outer table...
  • It scans the inner table for matching rows.

NLJ is efficient for small datasets or when the inner table's join column is indexed, allowing quick lookups.

NLJ in Action

Consider joining a small users table with a user_details table. If user_details.user_id is indexed, NLJ can be very fast.

Try creating and joining these tables:

CREATE TABLE users (user_id INT PRIMARY KEY, name VARCHAR(50));
CREATE TABLE user_details (detail_id INT PRIMARY KEY, user_id INT, address VARCHAR(100));

INSERT INTO users VALUES (1, 'Alice'), (2, 'Bob');
INSERT INTO user_details VALUES (101, 1, '123 Main St'), (102, 2, '456 Oak Ave');

SELECT u.name, ud.address
FROM users u
JOIN user_details ud ON u.user_id = ud.user_id;

Hash Join: Faster Matches

Hash Join is often chosen for larger, unsorted tables, especially with equality (=) join conditions. It works in two phases:

  1. Build Phase: PostgreSQL scans the smaller (or estimated smaller) table and builds an in-memory hash table using the join key.
  2. Probe Phase: It scans the larger table, hashes each row's join key, and probes the hash table for matches.

This method is very effective when enough memory is available for the hash table.

Hash Join Scenario

Imagine joining two large tables, products and sales, on their product_id. If neither table is sorted or indexed on product_id, a Hash Join is a strong candidate.

The planner will likely choose Hash Join for this query:

CREATE TABLE products (product_id INT PRIMARY KEY, name VARCHAR(50));
CREATE TABLE sales (sale_id INT PRIMARY KEY, product_id INT, quantity INT);

INSERT INTO products VALUES (1, 'Laptop'), (2, 'Mouse');
INSERT INTO sales VALUES (1001, 1, 2), (1002, 2, 1), (1003, 1, 3);

SELECT p.name, s.quantity
FROM products p
JOIN sales s ON p.product_id = s.product_id;

Merge Join: Sorted Efficiency

The Merge Join is highly efficient when both tables are already sorted on their join keys, or can be sorted cheaply. It also works in phases:

  1. Sort Phase: If not already sorted, both tables are sorted on their join columns.
  2. Merge Phase: PostgreSQL simultaneously scans both sorted tables, merging matching rows. It's like merging two sorted lists.

This is beneficial for range joins or when data is retrieved in sorted order.

Merge Join Use Case

If you're joining two tables, employees and departments, and both are indexed (and thus often sorted) on their respective ID columns, or if your query involves an ORDER BY on the join key, a Merge Join can be optimal.

PostgreSQL might use Merge Join here:

CREATE TABLE employees (emp_id INT PRIMARY KEY, dept_id INT, name VARCHAR(50));
CREATE TABLE departments (dept_id INT PRIMARY KEY, dept_name VARCHAR(50));

INSERT INTO employees VALUES (1, 10, 'John'), (2, 20, 'Jane');
INSERT INTO departments VALUES (10, 'HR'), (20, 'IT');

SELECT e.name, d.dept_name
FROM employees e
JOIN departments d ON e.dept_id = d.dept_id
ORDER BY e.emp_id;

PostgreSQL's Decisions

The PostgreSQL query planner uses a cost-based optimizer to decide which join algorithm to use. It estimates the cost of each possible plan based on:

  • Table and index statistics
  • Available memory (work_mem)
  • Join condition type (e.g., equality, range)
  • Estimated row counts

Using EXPLAIN is crucial to see which algorithm the planner chose!

Algorithm Challenge

You need to join two very large tables, customers and orders, on customer_id. There are no indexes on customer_id in either table, and the data is unsorted. Which join algorithm is PostgreSQL most likely to choose for optimal performance?

Join Algorithms: Key Takeaways

In this lesson, you explored the three primary join algorithms PostgreSQL uses:

  • Nested Loop Join: Simple, good for small sets or indexed inner tables.
  • Hash Join: Efficient for large, unsorted tables with equality joins, using a hash table.
  • Merge Join: Best when tables are already sorted on join keys or can be sorted cheaply.

Understanding these helps you interpret EXPLAIN plans and write more performant queries. Next, we'll look at rewriting complex joins!

Perguntas Frequentes

A aula “Entendendo os algoritmos de junção” é grátis?

Sim — o texto completo de “Entendendo os algoritmos de junção” é grátis para ler aqui na web. Para praticá-la interativamente (um editor de código integrado e um tutor de IA 24/7) e desbloquear o restante do curso de PostgreSQL Performance & Query Optimization, atualize para CoddyKit PRO. O curso de PostgreSQL Performance & Query Optimization inclui 4 aulas no total.

O que vou aprender em “Entendendo os algoritmos de junção”?

Explore como o PostgreSQL executa diferentes tipos de junção: Loop Aninhado, Junção por Hash e Junção por Mesclagem. Você pratica PostgreSQL Performance & Query Optimization com código prático que executa diretamente no navegador, e um tutor de IA 24/7 responde suas dúvidas enquanto trabalha na aula.

Preciso ter experiência prévia para começar PostgreSQL Performance & Query Optimization?

Nenhuma experiência prévia é necessária. PostgreSQL Performance & Query Optimization no CoddyKit é estruturado para alunos iniciantes até avançados, então você pode começar aqui ou desde o início e aprender no seu ritmo. Esta é a aula 1 de 4.

Quanto tempo leva a aula “Entendendo os algoritmos de junção”?

A maioria das aulas CoddyKit leva cerca de 5–10 minutos. Cada uma é compacta e interativa, então você faz progresso constante e retoma exatamente de onde parou entre web e app.

Posso escrever e executar código nesta aula de PostgreSQL Performance & Query Optimization?

Sim. Cada aula de PostgreSQL Performance & Query Optimization inclui um editor de código integrado, então você escreve e executa código real direto no navegador e recebe feedback de IA instantaneamente — nenhuma configuração local necessária.

Todas as aulas deste curso

  1. Entendendo os algoritmos de junção
  2. Reescrevendo junções complexas
  3. Subconsulta versus CTE versus junções
  4. Otimizando junções LATERAL e buscas correlacionadas
← Voltar para PostgreSQL Performance & Query Optimization