0Pricing
PostgreSQL Performance & Query Optimization · Aula

Interpretando nós de planos

Aprenda a interpretar nós de planos comuns, como varreduras sequenciais, varreduras de índices, tipos de junção e ordenações.

Interpretando nós de planos é uma aula grátis de PostgreSQL Performance & Query Optimization no CoddyKit. Esta é a aula 2 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.

Decoding Query Plans

Welcome back! In the previous lesson, you learned how to use EXPLAIN to view a query's execution plan. Now, let's dive into interpreting the different 'nodes' within these plans.

Each node represents a specific operation PostgreSQL performs. Understanding them is key to identifying performance bottlenecks.

What are Plan Nodes?

Think of a query plan as a tree, where each branch and leaf is a 'node'. These nodes tell you:

  • What operation is being done (e.g., scanning, sorting, joining).
  • How it's being done (e.g., sequentially, using an index).
  • Cost estimates: How much time and resources PostgreSQL *expects* the operation to take.

We'll look at the most common and important node types.

Sequential Scan: The Full Read

A Sequential Scan (often called a 'Seq Scan') means PostgreSQL reads every single row in a table from start to finish to find the data it needs.

  • When it happens: For small tables, or when querying a large portion of a table with no suitable index.
  • Performance impact: Can be slow for large tables, especially if only a few rows are needed.

It's like looking through every page of a book to find one sentence.

Seq Scan Example

Let's see a sequential scan in action. We'll create a simple table and then query it without an index.

CREATE TABLE products (
  product_id SERIAL PRIMARY KEY,
  name VARCHAR(100),
  price DECIMAL(10, 2)
);

INSERT INTO products (name, price) VALUES
('Laptop', 1200.00),
('Mouse', 25.00),
('Keyboard', 75.00),
('Monitor', 300.00);

EXPLAIN SELECT * FROM products WHERE price > 100;

Index Scan: Targeted Search

An Index Scan is much more efficient. PostgreSQL uses an index to quickly locate the specific rows it needs, much like using an index in a book.

  • When it happens: When a query uses a WHERE clause on an indexed column, and the index is selective enough.
  • Performance impact: Generally much faster than a sequential scan for selective queries on large tables.

It allows PostgreSQL to jump directly to the relevant data pages.

Index Scan Example

Now, let's add an index to our products table and observe the change in the query plan.

CREATE INDEX idx_products_price ON products (price);

EXPLAIN SELECT * FROM products WHERE price > 100;

Sort Node: Ordering Data

The Sort node appears when PostgreSQL needs to order data, typically for an ORDER BY or GROUP BY clause, and there isn't an index that can provide the data in the required order.

  • When it happens: Explicit ORDER BY, or implicitly for some operations like GROUP BY or unique constraints.
  • Performance impact: Sorting can be CPU and I/O intensive, especially for large datasets.

If the sort happens 'on disk' (meaning it can't fit in memory), it becomes even slower.

Sort Node Example

Here's an example where PostgreSQL has to sort the results because no index exists for the ordering column.

EXPLAIN SELECT name, price FROM products ORDER BY name DESC;

Join Nodes: Combining Tables

When you join two or more tables, PostgreSQL uses specific Join Nodes to combine the data. There are three primary types:

  • Nested Loop Join: Often good for small inner tables or when an index is available.
  • Hash Join: Efficient for larger tables where no useful index is present on the join key.
  • Merge Join: Requires both inputs to be sorted on the join key, then merges them.

The choice depends on table sizes, available indexes, and data distribution.

Nested Loop Join Example

Let's create another table and then join it with products to see a Nested Loop Join. This often happens when one side of the join is small.

CREATE TABLE orders (
  order_id SERIAL PRIMARY KEY,
  product_id INT,
  quantity INT
);

INSERT INTO orders (product_id, quantity) VALUES
(1, 1),
(2, 2),
(1, 3);

EXPLAIN SELECT p.name, o.quantity
FROM products p JOIN orders o ON p.product_id = o.product_id
WHERE o.order_id = 2;

Identify the Scan Type

Consider the following query and its execution plan snippet. What kind of scan is most likely being performed on the customers table?

EXPLAIN SELECT * FROM customers WHERE age > 30;

Partial Plan Output (assume no index on age):

  ->  Seq Scan on customers  (cost=0.00..10.50 rows=3 width=...)

Recap: Decoding Plan Nodes

You've taken a big step in understanding PostgreSQL performance by learning to interpret key plan nodes!

  • Sequential Scan: Full table read, can be slow for large tables.
  • Index Scan: Uses an index for targeted row access, faster for selective queries.
  • Sort: Occurs when data needs ordering and no suitable index exists.
  • Join Nodes: (Nested Loop, Hash, Merge) combine data from multiple tables, chosen based on data size and indexes.

In the next lesson, we'll put this knowledge to use to identify actual performance bottlenecks!

Perguntas Frequentes

A aula “Interpretando nós de planos” é grátis?

Sim — o texto completo de “Interpretando nós de planos” é 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 “Interpretando nós de planos”?

Aprenda a interpretar nós de planos comuns, como varreduras sequenciais, varreduras de índices, tipos de junção e ordenações. 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 2 de 4.

Quanto tempo leva a aula “Interpretando nós de planos”?

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. Introdução a EXPLAIN e ANALYZE
  2. Interpretando nós de planos
  3. Identificando gargalos de desempenho
  4. Lendo estimativas de custo e contagens de linhas do EXPLAIN
← Voltar para PostgreSQL Performance & Query Optimization