Skip to main content
Version: v2.x

Postgres: Query performance

Introduction

Sometimes queries can become slow due to large data volumes or levels of nesting. This page explains how to identify the query performance, and how queries can be optimized.

Analysing query performance

Let's say we want to analyse the following query:

query {
authors(where: { name: { _eq: "Mario" } }) {
rating
}
}

In order to analyse the performance of a query, you can click on the Analyze button on the Hasura console:

Query analyze button on Hasura console

The following query execution plan is generated:

Execution plan for Hasura GraphQL query

We can see that a sequential scan is conducted on the authors table. This means that Postgres goes through every row of the authors table in order to check if the author's name equals "Mario". The cost of a query is an arbitrary number generated by Postgres and is to be interpreted as a measure of comparison rather than an absolute measure of something.

Read more about query performance analysis in the Postgres explain statement docs.

Query optimization

Using PG indexes

Postgres indexes are special lookup tables that Postgres can use to speed up data lookup. An index acts as a pointer to data in a table, and it works very similar to an index in the back of a book. If you look in the index first, you'll find the data much quicker than searching the whole book (or - in this case - database).

Let's say we know that authors table is frequently queried by name:

query {
authors(where: { name: { _eq: "Mario" } }) {
rating
}
}

We've seen in the above example that by default Postgres conducts a sequential scan i.e. going through all the rows. Whenever there is a sequential scan, it can be optimized by adding an index.

The following statement sets an index on name in the authors table.

CREATE INDEX ON authors (name);

An index can be added in the Data -> SQL tab in the Hasura console.

Let's compare the performance analysis to the one before adding the index. What was a sequential scan in the example earlier is now an index scan. Index scans are usually more performant than sequential scans. We can also see that the cost of the query is now lower than the one before we added the index.

Execution plan for Hasura GraphQL query
Note

In some cases sequential scans can still be faster than index scans, e.g. if the result returns a high percentage of the rows in the table. Postgres comes up with multiple query plans and takes the call on what kind of scan would be faster.