explain.depesz.com

PostgreSQL's explain analyze made readable

Result: yaNm1

Settings
# exclusive inclusive rows x rows loops node
1. 0.034 7,114.284 ↑ 1.0 10 1

Limit (cost=186,623.10..186,623.13 rows=10 width=106) (actual time=7,114.247..7,114.284 rows=10 loops=1)

2. 94.895 7,114.250 ↑ 4,805.0 10 1

Sort (cost=186,623.10..186,743.23 rows=48,050 width=106) (actual time=7,114.245..7,114.250 rows=10 loops=1)

  • Sort Key: ((mainarticl0_2_.display_name ->> 'DE'::text)), mainarticl0_.id
  • Sort Method: top-N heapsort Memory: 26kB
3. 230.774 7,019.355 ↓ 2.9 137,501 1

Group (cost=185,104.26..185,584.76 rows=48,050 width=106) (actual time=6,683.521..7,019.355 rows=137,501 loops=1)

  • Group Key: mainarticl0_.id, mainarticl0_2_.display_name
4. 269.691 6,788.581 ↓ 2.9 137,501 1

Sort (cost=185,104.26..185,224.39 rows=48,050 width=74) (actual time=6,683.511..6,788.581 rows=137,501 loops=1)

  • Sort Key: mainarticl0_.id, mainarticl0_2_.display_name
  • Sort Method: external merge Disk: 11600kB
5. 307.489 6,518.890 ↓ 2.9 137,501 1

Nested Loop (cost=112,038.07..179,229.33 rows=48,050 width=74) (actual time=3,588.381..6,518.890 rows=137,501 loops=1)

6. 351.610 5,661.397 ↓ 2.9 137,501 1

Hash Join (cost=112,037.65..149,136.72 rows=48,050 width=64) (actual time=3,588.369..5,661.397 rows=137,501 loops=1)

  • Hash Cond: (vendorarti1_2_.parent_id = mainarticl0_1_.id)
7. 303.465 4,499.483 ↓ 2.9 137,501 1

Merge Semi Join (cost=97,239.40..130,727.63 rows=48,050 width=48) (actual time=2,777.132..4,499.483 rows=137,501 loops=1)

  • Merge Cond: (mainarticl0_.id = vendorarti1_2_.parent_id)
8. 242.789 242.789 ↑ 1.0 150,238 1

Index Only Scan using pk_main_article on main_article mainarticl0_ (cost=0.42..9,016.96 rows=150,238 width=16) (actual time=0.052..242.789 rows=150,238 loops=1)

  • Heap Fetches: 150238
9. 200.210 3,953.229 ↑ 1.3 183,383 1

Materialize (cost=97,148.16..120,521.46 rows=229,809 width=32) (actual time=2,777.073..3,953.229 rows=183,383 loops=1)

10. 521.301 3,753.019 ↑ 1.3 183,383 1

Merge Join (cost=97,148.16..119,946.94 rows=229,809 width=32) (actual time=2,777.056..3,753.019 rows=183,383 loops=1)

  • Merge Cond: (vendorarti1_2_.parent_id = articletre2_.id)
11. 391.615 2,930.801 ↑ 1.3 183,383 1

Sort (cost=97,143.27..97,717.79 rows=229,809 width=16) (actual time=2,776.995..2,930.801 rows=183,383 loops=1)

  • Sort Key: vendorarti1_2_.parent_id
  • Sort Method: external merge Disk: 4760kB
12. 616.540 2,539.186 ↑ 1.2 194,287 1

Hash Join (cost=40,313.71..72,748.19 rows=229,809 width=16) (actual time=1,576.685..2,539.186 rows=194,287 loops=1)

  • Hash Cond: (vendorarti1_2_.id = vendorarti1_.id)
13. 346.386 346.386 ↓ 1.0 442,102 1

Seq Scan on article_tree_node vendorarti1_2_ (cost=0.00..20,878.92 rows=441,192 width=32) (actual time=0.020..346.386 rows=442,102 loops=1)

14. 139.402 1,576.260 ↑ 1.2 194,287 1

Hash (cost=35,870.10..35,870.10 rows=229,809 width=32) (actual time=1,576.259..1,576.260 rows=194,287 loops=1)

  • Buckets: 65536 Batches: 8 Memory Usage: 2038kB
15. 519.580 1,436.858 ↑ 1.2 194,287 1

Hash Join (cost=19,345.86..35,870.10 rows=229,809 width=32) (actual time=661.298..1,436.858 rows=194,287 loops=1)

  • Hash Cond: (vendorarti1_1_.id = vendorarti1_.id)
16. 256.767 256.767 ↑ 1.0 438,411 1

Seq Scan on selectable_article vendorarti1_1_ (cost=0.00..7,177.11 rows=438,411 width=16) (actual time=0.009..256.767 rows=438,411 loops=1)

17. 159.165 660.511 ↑ 1.2 194,287 1

Hash (cost=15,350.24..15,350.24 rows=229,809 width=16) (actual time=660.509..660.511 rows=194,287 loops=1)

  • Buckets: 131072 Batches: 4 Memory Usage: 3315kB
18. 298.999 501.346 ↑ 1.2 194,287 1

Hash Join (cost=4.78..15,350.24 rows=229,809 width=16) (actual time=0.191..501.346 rows=194,287 loops=1)

  • Hash Cond: (vendorarti1_.vendor_id = vendorcomp3_.id)
19. 202.212 202.212 ↑ 1.0 288,173 1

Seq Scan on vendor_article vendorarti1_ (cost=0.00..11,966.73 rows=288,173 width=32) (actual time=0.032..202.212 rows=288,173 loops=1)

20. 0.044 0.135 ↑ 1.0 63 1

Hash (cost=3.99..3.99 rows=63 width=16) (actual time=0.134..0.135 rows=63 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 11kB
21. 0.091 0.091 ↑ 1.0 63 1

Seq Scan on vendor_company vendorcomp3_ (cost=0.00..3.99 rows=63 width=16) (actual time=0.020..0.091 rows=63 loops=1)

  • Filter: (status = 0)
  • Rows Removed by Filter: 16
22. 300.917 300.917 ↓ 1.1 487,979 1

Index Only Scan using pk_article_tree_node on article_tree_node articletre2_ (cost=0.42..18,522.30 rows=441,192 width=16) (actual time=0.037..300.917 rows=487,979 loops=1)

  • Heap Fetches: 0
23. 424.320 810.304 ↑ 1.0 438,411 1

Hash (cost=7,177.11..7,177.11 rows=438,411 width=16) (actual time=810.303..810.304 rows=438,411 loops=1)

  • Buckets: 131072 Batches: 8 Memory Usage: 3591kB
24. 385.984 385.984 ↑ 1.0 438,411 1

Seq Scan on selectable_article mainarticl0_1_ (cost=0.00..7,177.11 rows=438,411 width=16) (actual time=0.033..385.984 rows=438,411 loops=1)

25. 550.004 550.004 ↑ 1.0 1 137,501

Index Scan using pk_article_tree_node on article_tree_node mainarticl0_2_ (cost=0.42..0.62 rows=1 width=74) (actual time=0.003..0.004 rows=1 loops=137,501)

  • Index Cond: (id = vendorarti1_2_.parent_id)
Planning time : 17.765 ms
Execution time : 7,120.711 ms