explain.depesz.com

PostgreSQL's explain analyze made readable

Result: nuvV

Settings
# exclusive inclusive rows x rows loops node
1. 0.010 114.283 ↓ 10.0 20 1

Unique (cost=15,205.58..15,205.67 rows=2 width=129) (actual time=114.271..114.283 rows=20 loops=1)

2. 0.073 114.273 ↓ 10.0 20 1

Sort (cost=15,205.58..15,205.58 rows=2 width=129) (actual time=114.271..114.273 rows=20 loops=1)

  • Sort Key: tests."order", tests.id, tests.test_suite_id, tests.name, tests.description, tests.starting_url, tests.continue_previous, tests.removed, tests.hook, tests.created_at, tests.updated_at, job_sets.id, job_sets.status, tasks.id, tasks.status, tasks.running_time, jobs.ending_time, jobs.id
  • Sort Method: quicksort Memory: 30kB
3. 0.258 114.200 ↓ 10.0 20 1

Hash Join (cost=14,193.67..15,205.57 rows=2 width=129) (actual time=110.560..114.200 rows=20 loops=1)

  • Hash Cond: (tests.id = tests_1.id)
4. 0.770 113.862 ↓ 1.4 3,459 1

Hash Join (cost=14,177.01..15,182.27 rows=2,522 width=125) (actual time=110.308..113.862 rows=3,459 loops=1)

  • Hash Cond: (tests.test_suite_id = test_suites.id)
5. 1.027 112.994 ↓ 1.4 3,459 1

Hash Right Join (cost=14,166.22..15,136.81 rows=2,522 width=125) (actual time=110.201..112.994 rows=3,459 loops=1)

  • Hash Cond: (tasks.test_id = tests.id)
6. 0.069 110.659 ↓ 2.4 989 1

Nested Loop (cost=14,069.48..15,038.97 rows=417 width=42) (actual time=108.882..110.659 rows=989 loops=1)

7. 0.088 109.483 ↓ 1.4 369 1

Nested Loop (cost=14,069.19..14,706.98 rows=267 width=23) (actual time=108.872..109.483 rows=369 loops=1)

8. 0.044 109.098 ↑ 1.0 99 1

Nested Loop (cost=14,068.90..14,654.55 rows=100 width=15) (actual time=108.860..109.098 rows=99 loops=1)

9. 0.041 108.856 ↑ 1.0 99 1

HashAggregate (cost=14,068.61..14,069.61 rows=100 width=4) (actual time=108.843..108.856 rows=99 loops=1)

  • Group Key: job_sets_1.id
10. 0.005 108.815 ↑ 1.0 100 1

Limit (cost=14,066.36..14,067.36 rows=100 width=8) (actual time=108.784..108.815 rows=100 loops=1)

11. 21.231 108.810 ↑ 733.0 100 1

HashAggregate (cost=14,066.36..14,799.31 rows=73,295 width=8) (actual time=108.783..108.810 rows=100 loops=1)

  • Group Key: tasks_1.id, job_sets_1.id
12. 15.416 87.579 ↑ 1.0 73,295 1

Hash Join (cost=2,274.07..13,699.88 rows=73,295 width=8) (actual time=19.514..87.579 rows=73,295 loops=1)

  • Hash Cond: (jobs_1.job_set_id = job_sets_1.id)
13. 24.047 67.784 ↑ 1.0 73,295 1

Hash Join (cost=1,590.88..12,824.25 rows=73,295 width=8) (actual time=15.107..67.784 rows=73,295 loops=1)

  • Hash Cond: (tasks_1.job_id = jobs_1.id)
14. 29.047 29.047 ↑ 1.0 73,295 1

Seq Scan on tasks tasks_1 (cost=0.00..11,040.95 rows=73,295 width=8) (actual time=0.051..29.047 rows=73,295 loops=1)

15. 7.713 14.690 ↑ 1.0 46,928 1

Hash (cost=1,004.28..1,004.28 rows=46,928 width=8) (actual time=14.690..14.690 rows=46,928 loops=1)

  • Buckets: 65536 Batches: 1 Memory Usage: 2346kB
16. 6.977 6.977 ↑ 1.0 46,928 1

Seq Scan on jobs jobs_1 (cost=0.00..1,004.28 rows=46,928 width=8) (actual time=0.010..6.977 rows=46,928 loops=1)

17. 2.648 4.379 ↑ 1.0 17,560 1

Hash (cost=463.69..463.69 rows=17,560 width=4) (actual time=4.379..4.379 rows=17,560 loops=1)

  • Buckets: 32768 Batches: 1 Memory Usage: 874kB
18. 1.731 1.731 ↑ 1.0 17,560 1

Index Only Scan using job_sets_pkey on job_sets job_sets_1 (cost=0.29..463.69 rows=17,560 width=4) (actual time=0.011..1.731 rows=17,560 loops=1)

  • Heap Fetches: 0
19. 0.198 0.198 ↑ 1.0 1 99

Index Scan using job_sets_pkey on job_sets (cost=0.29..5.90 rows=1 width=11) (actual time=0.002..0.002 rows=1 loops=99)

  • Index Cond: (id = job_sets_1.id)
20. 0.297 0.297 ↓ 1.3 4 99

Index Scan using jobs_job_set_id on jobs (cost=0.29..0.49 rows=3 width=16) (actual time=0.003..0.003 rows=4 loops=99)

  • Index Cond: (job_set_id = job_sets.id)
21. 1.107 1.107 ↓ 1.5 3 369

Index Scan using tasks_job_id on tasks (cost=0.29..1.22 rows=2 width=23) (actual time=0.002..0.003 rows=3 loops=369)

  • Index Cond: (job_id = jobs.id)
22. 0.713 1.308 ↑ 1.0 2,522 1

Hash (cost=65.22..65.22 rows=2,522 width=87) (actual time=1.308..1.308 rows=2,522 loops=1)

  • Buckets: 4096 Batches: 1 Memory Usage: 352kB
23. 0.595 0.595 ↑ 1.0 2,522 1

Seq Scan on tests (cost=0.00..65.22 rows=2,522 width=87) (actual time=0.004..0.595 rows=2,522 loops=1)

24. 0.016 0.098 ↑ 1.0 137 1

Hash (cost=9.07..9.07 rows=137 width=4) (actual time=0.098..0.098 rows=137 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 13kB
25. 0.035 0.082 ↑ 1.0 137 1

Hash Join (cost=3.82..9.07 rows=137 width=4) (actual time=0.045..0.082 rows=137 loops=1)

  • Hash Cond: (test_suites.organization_id = organizations.id)
26. 0.009 0.009 ↑ 1.0 137 1

Seq Scan on test_suites (cost=0.00..3.37 rows=137 width=8) (actual time=0.002..0.009 rows=137 loops=1)

27. 0.003 0.038 ↑ 1.0 38 1

Hash (cost=3.35..3.35 rows=38 width=8) (actual time=0.038..0.038 rows=38 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 10kB
28. 0.018 0.035 ↑ 1.0 38 1

Hash Join (cost=1.85..3.35 rows=38 width=8) (actual time=0.020..0.035 rows=38 loops=1)

  • Hash Cond: (organization_members.organization_id = organizations.id)
29. 0.006 0.006 ↑ 1.0 38 1

Seq Scan on organization_members (cost=0.00..1.38 rows=38 width=4) (actual time=0.002..0.006 rows=38 loops=1)

30. 0.004 0.011 ↑ 1.0 38 1

Hash (cost=1.38..1.38 rows=38 width=4) (actual time=0.011..0.011 rows=38 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 10kB
31. 0.007 0.007 ↑ 1.0 38 1

Seq Scan on organizations (cost=0.00..1.38 rows=38 width=4) (actual time=0.002..0.007 rows=38 loops=1)

32. 0.001 0.080 ↑ 1.0 2 1

Hash (cost=16.64..16.64 rows=2 width=4) (actual time=0.080..0.080 rows=2 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
33. 0.001 0.079 ↑ 1.0 2 1

Limit (cost=16.61..16.62 rows=2 width=4) (actual time=0.077..0.079 rows=2 loops=1)

34. 0.002 0.078 ↑ 1.0 2 1

Unique (cost=16.61..16.62 rows=2 width=4) (actual time=0.077..0.078 rows=2 loops=1)

35. 0.004 0.076 ↑ 1.0 2 1

Sort (cost=16.61..16.61 rows=2 width=4) (actual time=0.076..0.076 rows=2 loops=1)

  • Sort Key: tests_1.id
  • Sort Method: quicksort Memory: 25kB
36. 0.002 0.072 ↑ 1.0 2 1

Nested Loop (cost=8.16..16.60 rows=2 width=4) (actual time=0.064..0.072 rows=2 loops=1)

37. 0.002 0.056 ↑ 1.0 1 1

Nested Loop (cost=3.87..5.60 rows=1 width=4) (actual time=0.049..0.056 rows=1 loops=1)

  • Join Filter: (test_suites_1.organization_id = organization_members_1.organization_id)
38. 0.012 0.046 ↑ 1.0 1 1

Hash Join (cost=3.73..5.22 rows=1 width=12) (actual time=0.039..0.046 rows=1 loops=1)

  • Hash Cond: (organizations_1.id = test_suites_1.organization_id)
39. 0.006 0.006 ↑ 1.0 38 1

Seq Scan on organizations organizations_1 (cost=0.00..1.38 rows=38 width=4) (actual time=0.005..0.006 rows=38 loops=1)

40. 0.002 0.028 ↑ 1.0 1 1

Hash (cost=3.71..3.71 rows=1 width=8) (actual time=0.028..0.028 rows=1 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
41. 0.026 0.026 ↑ 1.0 1 1

Seq Scan on test_suites test_suites_1 (cost=0.00..3.71 rows=1 width=8) (actual time=0.016..0.026 rows=1 loops=1)

  • Filter: (id = 137)
  • Rows Removed by Filter: 136
42. 0.008 0.008 ↑ 1.0 1 1

Index Only Scan using organization_members_organization_id on organization_members organization_members_1 (cost=0.14..0.37 rows=1 width=4) (actual time=0.008..0.008 rows=1 loops=1)

  • Index Cond: (organization_id = organizations_1.id)
  • Heap Fetches: 0
43. 0.006 0.014 ↑ 1.0 2 1

Bitmap Heap Scan on tests tests_1 (cost=4.30..10.98 rows=2 width=8) (actual time=0.013..0.014 rows=2 loops=1)

  • Recheck Cond: (test_suite_id = 137)
  • Filter: ((hook IS NULL) AND (NOT removed))
  • Heap Blocks: exact=2
44. 0.008 0.008 ↑ 1.0 2 1

Bitmap Index Scan on tests_test_suite_id (cost=0.00..4.29 rows=2 width=0) (actual time=0.008..0.008 rows=2 loops=1)

  • Index Cond: (test_suite_id = 137)
Planning time : 2.752 ms
Execution time : 115.685 ms