Re: BUG #8410: out of binary heap slots - Mailing list pgsql-bugs
| From | Terje Elde |
|---|---|
| Subject | Re: BUG #8410: out of binary heap slots |
| Date | |
| Msg-id | 32A956AB-3598-4721-B318-3E1430705E20@elde.net Whole thread Raw |
| In response to | BUG #8410: out of binary heap slots (terje@elde.net) |
| List | pgsql-bugs |
On Aug 30, 2013, at 10:46 PM, terje@elde.net wrote:
> The following bug has been logged on the website:
That didn't work out too well, rendering-wize.
Sending the explain analyze by email as well, hoping it'll be more =
readable:
=
QUERY PLAN =
=
=20
=
--------------------------------------------------------------------------=
--------------------------------------------------------------------------=
--------------------------------------------------------------------------=
-------------------------------------------------
HashAggregate (cost=3D423.84..424.15 rows=3D31 width=3D223) (actual =
time=3D0.668..0.675 rows=3D30 loops=3D1)
-> Append (cost=3D35.50..422.67 rows=3D31 width=3D223) (actual =
time=3D0.123..0.608 rows=3D30 loops=3D1)
-> Subquery Scan on apples (cost=3D35.50..412.18 rows=3D30 =
width=3D223) (actual time=3D0.123..0.600 rows=3D30 loops=3D1)
-> Limit (cost=3D35.50..411.88 rows=3D30 width=3D217) =
(actual time=3D0.122..0.591 rows=3D30 loops=3D1)
-> LockRows (cost=3D35.50..2494.50 rows=3D196 =
width=3D217) (actual time=3D0.121..0.584 rows=3D30 loops=3D1)
-> Nested Loop (cost=3D35.50..2492.54 =
rows=3D196 width=3D217) (actual time=3D0.113..0.544 rows=3D30 loops=3D1)
-> Nested Loop (cost=3D35.23..410.51 =
rows=3D196 width=3D207) (actual time=3D0.085..0.343 rows=3D30 loops=3D1)
-> Nested Loop =
(cost=3D34.95..319.23 rows=3D202 width=3D164) (actual time=3D0.078..0.264 =
rows=3D32 loops=3D1)
-> Nested Loop =
(cost=3D34.81..263.23 rows=3D211 width=3D147) (actual time=3D0.073..0.203 =
rows=3D32 loops=3D1)
-> Merge Append =
(cost=3D34.66..172.40 rows=3D354 width=3D141) (actual time=3D0.067..0.126 =
rows=3D32 loops=3D1)
Sort Key: =
p.startt
-> Sort =
(cost=3D0.01..0.02 rows=3D1 width=3D669) (actual time=3D0.016..0.016 =
rows=3D0 loops=3D1)
Sort Key: =
p.startt
Sort =
Method: quicksort Memory: 25kB
-> Seq =
Scan on cars p (cost=3D0.00..0.00 rows=3D1 width=3D669) (actual =
time=3D0.001..0.001 rows=3D0 loops=3D1)
=
Filter: ((startt > '2013-07-05 19:11:41.958154'::timestamp without time =
zone) AND (endt > now()) AND (bus =3D ANY ('{m,f," "," =
",NULL}'::character(1)[])) AND (startt < (now() + =
'00:15:00'::interval)))
-> Index Scan =
Backward using cars_startt on cars_2013 p_1 (cost=3D0.28..129.49 =
rows=3D351 width=3D136) (actual time=3D0.043..0.096 rows=3D32 loops=3D1)
Index =
Cond: ((startt < (now() + '00:15:00'::interval)) AND (startt > =
'2013-07-05 19:11:41.958154'::timestamp without time zone))
Filter: =
((endt > now()) AND (bus =3D ANY ('{m,f," "," =
",NULL}'::character(1)[])))
-> Sort =
(cost=3D13.45..13.45 rows=3D1 width=3D669) (actual time=3D0.004..0.004 =
rows=3D0 loops=3D1)
Sort Key: =
p_2.startt
Sort =
Method: quicksort Memory: 25kB
-> Seq =
Scan on cars_2014 p_2 (cost=3D0.00..13.44 rows=3D1 width=3D669) (actual =
time=3D0.000..0.000 rows=3D0 loops=3D1)
=
Filter: ((startt > '2013-07-05 19:11:41.958154'::timestamp without time =
zone) AND (endt > now()) AND (bus =3D ANY ('{m,f," "," =
",NULL}'::character(1)[])) AND (startt < (now() + =
'00:15:00'::interval)))
-> Sort =
(cost=3D13.45..13.45 rows=3D1 width=3D669) (actual time=3D0.004..0.004 =
rows=3D0 loops=3D1)
Sort Key: =
p_3.startt
Sort =
Method: quicksort Memory: 25kB
-> Seq =
Scan on cars_2015 p_3 (cost=3D0.00..13.44 rows=3D1 width=3D669) (actual =
time=3D0.000..0.000 rows=3D0 loops=3D1)
=
Filter: ((startt > '2013-07-05 19:11:41.958154'::timestamp without time =
zone) AND (endt > now()) AND (bus =3D ANY ('{m,f," "," =
",NULL}'::character(1)[])) AND (startt < (now() + =
'00:15:00'::interval)))
-> Index Scan using =
oranges_pkey on oranges s (cost=3D0.14..0.25 rows=3D1 width=3D10) =
(actual time=3D0.002..0.002 rows=3D1 loops=3D32)
Index Cond: (id =
=3D p.agent)
Filter: =
(visible AND (carpool =3D 100))
-> Index Scan using =
roadworkers_pkey on roadworkers e (cost=3D0.14..0.26 rows=3D1 width=3D25)=
(actual time=3D0.001..0.001 rows=3D1 loops=3D32)
Index Cond: (id =3D =
p.employee)
-> Index Scan using bikes_pkey =
on bikes i (cost=3D0.28..0.44 rows=3D1 width=3D55) (actual =
time=3D0.002..0.002 rows=3D1 loops=3D32)
Index Cond: (id =3D p.bike)
Filter: (source IS NOT =
NULL)
Rows Removed by Filter: 0
-> Index Scan using cars_stats_pkey on =
cars_stats ps (cost=3D0.28..0.48 rows=3D1 width=3D18) (actual =
time=3D0.003..0.003 rows=3D1 loops=3D30)
Index Cond: (id =3D p.id)
SubPlan 2
-> Index Only Scan using =
fruit_tags_pkey on fruit_tags fruit_tags_1 (cost=3D0.28..10.14 rows=3D3 =
width=3D4) (actual time=3D0.001..0.002 rows=3D2 loops=3D30)
Index Cond: (fruit =3D p.id)
Heap Fetches: 60
-> Subquery Scan on updated (cost=3D10.16..10.18 rows=3D1 =
width=3D221) (actual time=3D0.005..0.005 rows=3D0 loops=3D1)
-> Limit (cost=3D10.16..10.17 rows=3D1 width=3D0) =
(actual time=3D0.005..0.005 rows=3D0 loops=3D1)
-> LockRows (cost=3D10.16..10.17 rows=3D1 =
width=3D0) (actual time=3D0.005..0.005 rows=3D0 loops=3D1)
-> Sort (cost=3D10.16..10.16 rows=3D1 =
width=3D0) (actual time=3D0.005..0.005 rows=3D0 loops=3D1)
Sort Key: last_change
Sort Method: quicksort Memory: 25kB
-> Result (cost=3D0.00..10.15 rows=3D1 =
width=3D0) (actual time=3D0.000..0.000 rows=3D0 loops=3D1)
One-Time Filter: false
SubPlan 1
-> Index Only Scan using =
fruit_tags_pkey on fruit_tags (cost=3D0.28..10.14 rows=3D3 width=3D4) =
(never executed)
Index Cond: (fruit =3D =
id)
Heap Fetches: 0
Total runtime: 0.885 ms
(57 rows)
pgsql-bugs by date: