Tom Lane kirjutas T, 11.02.2003 kell 18:39:
> Bruno Wolff III <[EMAIL PROTECTED]> writes:
> >   Tom Lane <[EMAIL PROTECTED]> wrote:
> >> Greg Stark <[EMAIL PROTECTED]> writes:
> >>> The neat thing is that hash aggregates would allow grouping on data types that
> >>> have = operators but no useful < operator.
> >> 
> >> Hm.  Right now I think that would barf on you, because the parser wants
> >> to find the '<' operator to label the grouping column with, even if the
> >> planner later decides not to use it.  It'd take some redesign of the
> >> query data structure (specifically SortClause/GroupClause) to avoid that.
> > I think another issue is that for some = operators you still might not
> > be able to use a hash. I would expect the discussion for hash joins in
> >
> > would to hash aggregates as well.
> Right, the = operator must be hashable or you're out of luck.  But we
> could imagine tweaking the parser to allow GROUP BY if it finds a
> hashable = operator and no sort operator.  The only objection I can see
> to this is that it means the planner *must* use hash aggregation, which
> might be a bad move if there are too many distinct groups.

If we run out of sort memory, we can always bail out later, preferrably
with a descriptive error message. It is not as elegant as erring out at
parse (or even plan/optimise) time, but the result is /almost/ the same.

Relying on hash aggregation will become essential if we are ever going
to implement the "other" groupings (CUBE, ROLLUP, (), ...), so it would
be nice if hash aggregation could also overflow to disk - I suspect that
this will still be faster that running an independent scan for each
GROUP BY grouping and merging the results.


---------------------------(end of broadcast)---------------------------
TIP 1: subscribe and unsubscribe commands go to [EMAIL PROTECTED]

Reply via email to