การตีความโหนดในแผน

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.

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.

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.

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

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.

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

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.

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

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.

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.

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=...)

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!