explain.depesz.com

PostgreSQL's explain analyze made readable

Result: cQ0n : UNION ALL

Settings
# exclusive inclusive rows x rows loops node
1. 0.002 0.061 ↑ 1.0 2 1

Append (cost=0.42..0.88 rows=2 width=16) (actual time=0.049..0.061 rows=2 loops=1)

  • Buffers: shared hit=8
2. 0.001 0.048 ↑ 1.0 1 1

Limit (cost=0.42..0.44 rows=1 width=16) (actual time=0.048..0.048 rows=1 loops=1)

  • Output: the_table.c1, the_table.c2, the_table.count
  • Buffers: shared hit=4
3. 0.047 0.047 ↑ 1,000,000.0 1 1

Index Scan using the_table_count_idx on stuff.the_table (cost=0.42..12,021.42 rows=1,000,000 width=16) (actual time=0.047..0.047 rows=1 loops=1)

  • Output: the_table.c1, the_table.c2, the_table.count
  • Buffers: shared hit=4
4. 0.000 0.011 ↑ 1.0 1 1

Limit (cost=0.42..0.44 rows=1 width=16) (actual time=0.011..0.011 rows=1 loops=1)

  • Output: the_table_1.c1, the_table_1.c2, the_table_1.count
  • Buffers: shared hit=4
5. 0.011 0.011 ↑ 1,000,000.0 1 1

Index Scan Backward using the_table_count_idx on stuff.the_table the_table_1 (cost=0.42..12,021.42 rows=1,000,000 width=16) (actual time=0.011..0.011 rows=1 loops=1)

  • Output: the_table_1.c1, the_table_1.c2, the_table_1.count
  • Buffers: shared hit=4
Planning time : 0.170 ms
Execution time : 0.082 ms