explain.depesz.com

A tool for finding a real cause for slow queries.

Result: 4zu

options
Did it help? Consider supporting us - Bitcoin address: 12v2hUztAk2LgzQ9H9LMwuU32urHMjZQnq
# exclusive inclusive rows x rows loops node
1. 0.020 174.788 ↑ 2.0 1 1

Sort (cost=5,784.07..5,784.08 rows=2 width=243) (actual time=174.787..174.788 rows=1 loops=1)

  • Sort Key: la.year
  • Sort Method: quicksort Memory: 25kB
2. 13.134 174.768 ↑ 2.0 1 1

Hash Right Join (cost=3,384.48..5,784.06 rows=2 width=243) (actual time=174.761..174.768 rows=1 loops=1)

  • Hash Cond: (f.id = la.embeddedcoverartfile_id)
3. 53.609 73.267 ↑ 1.0 55,081 1

Hash Join (cost=308.00..2,500.93 rows=55,098 width=86) (actual time=6.776..73.267 rows=55,081 loops=1)

  • Hash Cond: (f.directory_id = d.id)
4. 12.919 12.919 ↑ 1.0 55,081 1

Seq Scan on file f (cost=0.00..1,090.98 rows=55,098 width=32) (actual time=0.008..12.919 rows=55,081 loops=1)

5. 3.777 6.739 ↓ 1.0 6,623 1

Hash (cost=225.22..225.22 rows=6,622 width=62) (actual time=6.739..6.739 rows=6,623 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 622kB
6. 2.962 2.962 ↓ 1.0 6,623 1

Seq Scan on directory d (cost=0.00..225.22 rows=6,622 width=62) (actual time=0.006..2.962 rows=6,623 loops=1)

7. 0.006 88.367 ↑ 2.0 1 1

Hash (cost=3,076.46..3,076.46 rows=2 width=165) (actual time=88.367..88.367 rows=1 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 1kB
8. 13.289 88.361 ↑ 2.0 1 1

Hash Right Join (cost=676.90..3,076.46 rows=2 width=165) (actual time=88.353..88.361 rows=1 loops=1)

  • Hash Cond: (f.id = la.coverartfile_id)
9. 49.944 69.949 ↑ 1.0 55,081 1

Hash Join (cost=308.00..2,500.93 rows=55,098 width=86) (actual time=7.142..69.949 rows=55,081 loops=1)

  • Hash Cond: (f.directory_id = d.id)
10. 12.900 12.900 ↑ 1.0 55,081 1

Seq Scan on file f (cost=0.00..1,090.98 rows=55,098 width=32) (actual time=0.008..12.900 rows=55,081 loops=1)

11. 3.913 7.105 ↓ 1.0 6,623 1

Hash (cost=225.22..225.22 rows=6,622 width=62) (actual time=7.105..7.105 rows=6,623 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 622kB
12. 3.192 3.192 ↓ 1.0 6,623 1

Seq Scan on directory d (cost=0.00..225.22 rows=6,622 width=62) (actual time=0.005..3.192 rows=6,623 loops=1)

13. 0.005 5.123 ↑ 2.0 1 1

Hash (cost=368.88..368.88 rows=2 width=87) (actual time=5.123..5.123 rows=1 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 1kB
14. 1.665 5.118 ↑ 2.0 1 1

Hash Right Join (cost=154.05..368.88 rows=2 width=87) (actual time=2.847..5.118 rows=1 loops=1)

  • Hash Cond: (ai.album_id = la.album_id)
15. 1.590 1.590 ↓ 1.0 4,810 1

Seq Scan on albuminfo ai (cost=0.00..197.13 rows=4,713 width=56) (actual time=0.008..1.590 rows=4,810 loops=1)

16. 0.006 1.863 ↑ 2.0 1 1

Hash (cost=154.03..154.03 rows=2 width=39) (actual time=1.863..1.863 rows=1 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 1kB
17. 0.006 1.857 ↑ 2.0 1 1

Nested Loop (cost=0.00..154.03 rows=2 width=39) (actual time=1.106..1.857 rows=1 loops=1)

18. 1.830 1.830 ↑ 2.0 1 1

Seq Scan on album ma (cost=0.00..137.46 rows=2 width=25) (actual time=1.080..1.830 rows=1 loops=1)

  • Filter: (artist_id = 28368)
19. 0.021 0.021 ↑ 1.0 1 1

Index Scan using album_albumid on album la (cost=0.00..8.27 rows=1 width=14) (actual time=0.020..0.021 rows=1 loops=1)

  • Index Cond: (album_id = ma.id)