explain.depesz.com

PostgreSQL's explain analyze made readable

Result: ROaL

Settings
# exclusive inclusive rows x rows loops node
1. 0.036 6,609.084 ↑ 1.0 10 1

Limit (cost=126,550.52..126,550.54 rows=10 width=106) (actual time=6,609.046..6,609.084 rows=10 loops=1)

2. 122.233 6,609.048 ↑ 4,814.9 10 1

Sort (cost=126,550.52..126,670.89 rows=48,149 width=106) (actual time=6,609.043..6,609.048 rows=10 loops=1)

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

HashAggregate (cost=124,908.17..125,510.04 rows=48,149 width=106) (actual time=6,303.996..6,486.815 rows=137,501 loops=1)

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

Hash Join (cost=99,374.49..124,667.43 rows=48,149 width=74) (actual time=5,180.322..6,108.566 rows=137,501 loops=1)

  • Hash Cond: (vendorarti1_2_.parent_id = mainarticl0_.id)
5. 437.757 4,752.080 ↓ 2.9 137,501 1

Hash Join (cost=82,495.63..107,163.43 rows=48,149 width=106) (actual time=4,030.897..4,752.080 rows=137,501 loops=1)

  • Hash Cond: (mainarticl0_2_.id = vendorarti1_2_.parent_id)
6. 284.222 284.222 ↑ 1.0 442,102 1

Seq Scan on article_tree_node mainarticl0_2_ (cost=0.00..20,888.02 rows=442,102 width=74) (actual time=0.005..284.222 rows=442,102 loops=1)

7. 101.440 4,030.101 ↑ 1.7 137,501 1

Hash (cost=79,623.01..79,623.01 rows=229,809 width=32) (actual time=4,030.100..4,030.101 rows=137,501 loops=1)

  • Buckets: 262144 Batches: 1 Memory Usage: 10642kB
8. 284.295 3,928.661 ↑ 1.7 137,501 1

HashAggregate (cost=77,324.92..79,623.01 rows=229,809 width=32) (actual time=3,815.222..3,928.661 rows=137,501 loops=1)

  • Group Key: articletre2_.id
9. 511.631 3,644.366 ↑ 1.3 183,383 1

Hash Join (cost=32,286.80..76,750.40 rows=229,809 width=32) (actual time=1,631.815..3,644.366 rows=183,383 loops=1)

  • Hash Cond: (vendorarti1_2_.id = vendorarti1_.id)
10. 844.703 1,501.824 ↑ 1.1 407,564 1

Merge Join (cost=72.09..40,579.72 rows=442,102 width=48) (actual time=0.059..1,501.824 rows=407,564 loops=1)

  • Merge Cond: (vendorarti1_2_.parent_id = articletre2_.id)
11. 251.967 251.967 ↑ 1.1 407,565 1

Index Only Scan using ix_article_tree_node_parent_id2 on article_tree_node vendorarti1_2_ (cost=0.42..17,227.95 rows=442,102 width=32) (actual time=0.042..251.967 rows=407,565 loops=1)

  • Heap Fetches: 0
12. 405.154 405.154 ↓ 1.6 703,795 1

Index Only Scan using pk_article_tree_node on article_tree_node articletre2_ (cost=0.42..18,535.95 rows=442,102 width=16) (actual time=0.010..405.154 rows=703,795 loops=1)

  • Heap Fetches: 0
13. 169.580 1,630.911 ↑ 1.2 194,287 1

Hash (cost=29,342.10..29,342.10 rows=229,809 width=32) (actual time=1,630.911..1,630.911 rows=194,287 loops=1)

  • Buckets: 262144 Batches: 1 Memory Usage: 14191kB
14. 528.421 1,461.331 ↑ 1.2 194,287 1

Hash Join (cost=18,222.86..29,342.10 rows=229,809 width=32) (actual time=686.609..1,461.331 rows=194,287 loops=1)

  • Hash Cond: (vendorarti1_1_.id = vendorarti1_.id)
15. 247.175 247.175 ↑ 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.014..247.175 rows=438,411 loops=1)

16. 175.722 685.735 ↑ 1.2 194,287 1

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

  • Buckets: 262144 Batches: 1 Memory Usage: 11156kB
17. 308.257 510.013 ↑ 1.2 194,287 1

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

  • Hash Cond: (vendorarti1_.vendor_id = vendorcomp3_.id)
18. 201.643 201.643 ↑ 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.018..201.643 rows=288,173 loops=1)

19. 0.046 0.113 ↑ 1.0 63 1

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

  • Buckets: 1024 Batches: 1 Memory Usage: 11kB
20. 0.067 0.067 ↑ 1.0 63 1

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

  • Filter: (status = 0)
  • Rows Removed by Filter: 16
21. 133.811 1,148.395 ↑ 1.0 150,238 1

Hash (cost=15,000.89..15,000.89 rows=150,238 width=32) (actual time=1,148.394..1,148.395 rows=150,238 loops=1)

  • Buckets: 262144 Batches: 1 Memory Usage: 11438kB
22. 464.215 1,014.584 ↑ 1.0 150,238 1

Hash Join (cost=4,677.36..15,000.89 rows=150,238 width=32) (actual time=279.682..1,014.584 rows=150,238 loops=1)

  • Hash Cond: (mainarticl0_1_.id = mainarticl0_.id)
23. 271.761 271.761 ↑ 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.031..271.761 rows=438,411 loops=1)

24. 150.027 278.608 ↑ 1.0 150,238 1

Hash (cost=2,799.38..2,799.38 rows=150,238 width=16) (actual time=278.607..278.608 rows=150,238 loops=1)

  • Buckets: 262144 Batches: 1 Memory Usage: 9091kB
25. 128.581 128.581 ↑ 1.0 150,238 1

Seq Scan on main_article mainarticl0_ (cost=0.00..2,799.38 rows=150,238 width=16) (actual time=0.031..128.581 rows=150,238 loops=1)

Planning time : 8.709 ms
Execution time : 6,610.832 ms