explain.depesz.com

A tool for finding a real cause for slow queries.

Result: wfg

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

HashAggregate (cost=17.84..17.85 rows=1 width=1) (actual time=.. rows= loops=)

2. 0.000 0.000 ↓ 0.0
→

Subquery Scan on t1 (cost=17.56..17.83 rows=1 width=8) (actual time=.. rows= loops=)

3. 0.000 0.000 ↓ 0.0
→

Limit (cost=17.56..17.57 rows=1 width=8) (actual time=.. rows= loops=)

4. 0.000 0.000 ↓ 0.0
→

Sort (cost=17.56..17.57 rows=1 width=8) (actual time=.. rows= loops=)

  • Sort Key: kv.id
5. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_kv_request_date on kv (cost=0.00..17.55 rows=1 width=8) (actual time=.. rows= loops=)

  • Index Cond: (request_date = '2012-04-22'::date)
  • Filter: ((NOT is_attempted) AND (NOT is_processed))