-> Subquery Scan on t1 (cost=164.16..243.26 rows=753 width=12) (actual time=0.043..0.048 rows=2 loops=1) |
Output: t1.dat, t1.td, t1.l_td |
Filter: ((t1.l_td - t1.td) > '03:00:00'::interval) |
Rows Removed by Filter: 12 |
Buffers: shared hit=1 |
-> WindowAgg (cost=164.16..209.36 rows=2260 width=20) (actual time=0.033..0.044 rows=14 loops=1) |
Output: ((test_1.the_date)::date), test_1.the_date, lead(test_1.the_date) OVER (?) |
Buffers: shared hit=1 |
-> Sort (cost=164.16..169.81 rows=2260 width=12) (actual time=0.022..0.024 rows=14 loops=1) |
Output: ((test_1.the_date)::date), test_1.the_date |
Sort Key: ((test_1.the_date)::date) |
Sort Method: quicksort Memory: 25kB |
Buffers: shared hit=1 |
-> Seq Scan on public.test test_1 (cost=0.00..38.25 rows=2260 width=12) (actual time=0.010..0.014 rows=14 loops=1) |
Output: (test_1.the_date)::date, test_1.the_date |
Buffers: shared hit=1 |
-> HashAggregate (cost=73.25..77.23 rows=398 width=12) (actual time=0.097..0.098 rows=2 loops=1) |
Output: long_gaps.dat, long_gaps.gap |
Group Key: long_gaps.dat, long_gaps.gap |
Buffers: shared hit=2 |
-> Append (cost=0.00..71.26 rows=398 width=12) (actual time=0.052..0.093 rows=2 loops=1) |
Buffers: shared hit=2 |
-> CTE Scan on long_gaps (cost=0.00..3.96 rows=198 width=12) (actual time=0.052..0.052 rows=1 loops=1) |
Output: long_gaps.dat, long_gaps.gap |
Buffers: shared hit=1 |
-> HashAggregate (cost=56.83..59.33 rows=200 width=12) (actual time=0.039..0.039 rows=1 loops=1) |
Output: ((test.the_date)::date), max(test.the_date) |
Group Key: (test.the_date)::date |
Buffers: shared hit=1 |
-> Seq Scan on public.test (cost=4.46..51.18 rows=1130 width=12) (actual time=0.027..0.034 rows=8 loops=1) |
Output: (test.the_date)::date, test.the_date |
Filter: (NOT (hashed SubPlan 2)) |
Rows Removed by Filter: 6 |
Buffers: shared hit=1 |
SubPlan 2 |
-> CTE Scan on long_gaps long_gaps_1 (cost=0.00..3.96 rows=198 width=4) (actual time=0.001..0.001 rows=1 loops=1) |
Output: long_gaps_1.dat |
Planning Time: 0.164 ms |
Execution Time: 0.207 ms |