Tom Lane wrote:
Alan Stange <[EMAIL PROTECTED]> writes:
Unique (cost=2717137.08..2771407.21 rows=10854026 width=8)
-> Sort (cost=2717137.08..2744272.14 rows=10854026 width=8)
Sort Key: timeseriesid
-> Bitmap Heap Scan on tbltimeseries
(cost=48714.09..1331000.42 row
> Hello all,
>
> I was hoping someone could explain the plan for a statement.
>
> We have a table with a column of longs being used as an index. The
> query plan in 8.0 was like this:
>
> # explain select distinct timeseriesid from tbltimeseries where
> timeseriesid > 0 order by timeseriesid;
Alan Stange <[EMAIL PROTECTED]> writes:
> Unique (cost=2717137.08..2771407.21 rows=10854026 width=8)
>-> Sort (cost=2717137.08..2744272.14 rows=10854026 width=8)
> Sort Key: timeseriesid
> -> Bitmap Heap Scan on tbltimeseries
> (cost=48714.09..1331000.42 rows=10854026 w
On Fri, Aug 26, 2005 at 10:45:07AM -0400, Alan Stange wrote:
> -> Bitmap Heap Scan on tbltimeseries (cost=48714.09..1331000.42
> rows=10854026 width=8)
> Recheck Cond: (timeseriesid > 0)
> -> Bitmap Index Scan on idx_timeseris (cost=0.00..48714.09
> rows=1085
Hello all,
I was hoping someone could explain the plan for a statement.
We have a table with a column of longs being used as an index. The
query plan in 8.0 was like this:
# explain select distinct timeseriesid from tbltimeseries where
timeseriesid > 0 order by timeseriesid;
SET
