explain.depesz.com

A tool for finding a real cause for slow queries.

Result: EDb

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

Hash Left Join (cost=39.45..61.71 rows=3 width=1556) (actual time=.. rows= loops=)

  • Hash Cond: (h0.subj = u_s.id)
2. 0.000 0.000 ↓ 0.0
→

Hash Left Join (cost=26.30..48.52 rows=3 width=1040) (actual time=.. rows= loops=)

  • Hash Cond: (h0.obj = l_d.id)
  • Filter: (CASE WHEN ((t_d.value IS NOT NULL) AND (((mod(((h0.obj >> 28) + 16), 16))::numeric = 8.0) OR ((abs((t_d.value - 1188000000000::bigint)))::numeric > 25200000::numeric))) THEN (t_d.value = 1188000000000::bigint) WHEN (((d_d.value)::text = 'http://www.w3.org/2001/XMLSchema#dateTime'::text) AND ((l_d.value)::text = '2007-08-25T00:00:00'::text)) THEN true ELSE NULL::boolean END OR CASE WHEN ((t_d.value IS NOT NULL) AND (((mod(((h0.obj >> 28) + 16), 16))::numeric = 8.0) OR ((abs((t_d.value - 1188001800000::bigint)))::numeric > 25200000::numeric))) THEN (t_d.value = 1188001800000::bigint) WHEN (((d_d.value)::text = 'http://www.w3.org/2001/XMLSchema#dateTime'::text) AND ((l_d.value)::text = '2007-08-25T00:30:00'::text)) THEN true ELSE NULL::boolean END OR CASE WHEN ((t_d.value IS NOT NULL) AND (((mod(((h0.obj >> 28) + 16), 16))::numeric = 8.0) OR ((abs((t_d.value - 1188000900000::bigint)))::numeric > 25200000::numeric))) THEN (t_d.value = 1188000900000::bigint) WHEN (((d_d.value)::text = 'http://www.w3.org/2001/XMLSchema#dateTime'::text) AND ((l_d.value)::text = '2007-08-25T00:15:00'::text)) THEN true ELSE NULL::boolean END)
3. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=13.15..35.06 rows=3 width=532) (actual time=.. rows= loops=)

4. 0.000 0.000 ↓ 0.0
→

Hash Left Join (cost=13.15..14.22 rows=3 width=524) (actual time=.. rows= loops=)

  • Hash Cond: (h0.obj = d_d.id)
5. 0.000 0.000 ↓ 0.0
→

Seq Scan on hasdatetime_2 h0 (cost=0.00..1.03 rows=3 width=8) (actual time=.. rows= loops=)

6. 0.000 0.000 ↓ 0.0
→

Hash (cost=11.40..11.40 rows=140 width=520) (actual time=.. rows= loops=)

7. 0.000 0.000 ↓ 0.0
→

Seq Scan on datatype_values d_d (cost=0.00..11.40 rows=140 width=520) (actual time=.. rows= loops=)

8. 0.000 0.000 ↓ 0.0
→

Index Scan using datetime_values_pkey on datetime_values t_d (cost=0.00..6.93 rows=1 width=12) (actual time=.. rows= loops=)

  • Index Cond: (t_d.id = h0.obj)
9. 0.000 0.000 ↓ 0.0
→

Hash (cost=11.40..11.40 rows=140 width=520) (actual time=.. rows= loops=)

10. 0.000 0.000 ↓ 0.0
→

Seq Scan on label_values l_d (cost=0.00..11.40 rows=140 width=520) (actual time=.. rows= loops=)

11. 0.000 0.000 ↓ 0.0
→

Hash (cost=11.40..11.40 rows=140 width=520) (actual time=.. rows= loops=)

12. 0.000 0.000 ↓ 0.0
→

Seq Scan on uri_values u_s (cost=0.00..11.40 rows=140 width=520) (actual time=.. rows= loops=)