explain.depesz.com

A tool for finding a real cause for slow queries.

Result: pT2 : hist

options
# exclusive inclusive rows x rows loops node
1. 0.000 0.000 ↓ 0.0
→

Insert on hist_20120604 (cost=7356.960..7403.400 rows=516 width=246) (actual time=.. rows= loops=)

2. 0.000 0.000 ↓ 0.0
→

Subquery Scan on *SELECT* (cost=7356.960..7403.400 rows=516 width=246) (actual time=.. rows= loops=)

3. 0.000 0.000 ↓ 0.0
→

GroupAggregate (cost=7356.960..7372.440 rows=516 width=158) (actual time=.. rows= loops=)

4. 0.000 0.000 ↓ 0.0
→

Sort (cost=7356.960..7358.250 rows=516 width=158) (actual time=.. rows= loops=)

  • Sort Key: november.five
5. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=5201.610..7333.710 rows=516 width=158) (actual time=.. rows= loops=)

  • Hash Cond: (delta.five = november.five)
6. 0.000 0.000 ↓ 0.0
→

Seq Scan on bravo delta (cost=0.000..1741.610 rows=102761 width=6) (actual time=.. rows= loops=)

7. 0.000 0.000 ↓ 0.0
→

Hash (cost=5195.160..5195.160 rows=516 width=156) (actual time=.. rows= loops=)

8. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=3728.750..5195.160 rows=516 width=156) (actual time=.. rows= loops=)

  • Hash Cond: (yankee_echo.five = november.five)
9. 0.000 0.000 ↓ 0.0
→

Seq Scan on six yankee_echo (cost=0.000..1193.960 rows=71696 width=6) (actual time=.. rows= loops=)

10. 0.000 0.000 ↓ 0.0
→

Hash (cost=3722.300..3722.300 rows=516 width=154) (actual time=.. rows= loops=)

11. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=2896.310..3722.300 rows=516 width=154) (actual time=.. rows= loops=)

  • Hash Cond: (four.five = november.five)
12. 0.000 0.000 ↓ 0.0
→

Seq Scan on quebec four (cost=0.000..670.690 rows=40869 width=8) (actual time=.. rows= loops=)

13. 0.000 0.000 ↓ 0.0
→

Hash (cost=2889.860..2889.860 rows=516 width=150) (actual time=.. rows= loops=)

14. 0.000 0.000 ↓ 0.0
→

Seq Scan on kilo november (cost=0.000..2889.860 rows=516 width=150) (actual time=.. rows= loops=)

  • Filter: ((yankee_alpha)::date = 'lima'::date)