2010/10/1 Hitoshi Harada <umi(dot)tanuki(at)gmail(dot)com>:
> 2010/9/26 Pavel Stehule <pavel(dot)stehule(at)gmail(dot)com>:
>> there is updated version - with support of window clause. The limits
>> are work_mem for using inside window aggregate or unlimited when it is
>> used as standard query.
>> This patch needs a few work - can share a compare functionality with
>> tuplesort.c, but I would to verify a concept now.
> Sorry for delay. I read the patch and it seems the result is sane. For
> window function calls, I agree that the current tuplesort is not
> enough to implement median functions and the patch introduces its own
> memsort mechanism, although memsort has too much copied from
> tuplesort. It looks to me not so difficult to modify the existing
> tuplesort to guarantee staying in memory always if an option to do so
> is specified from caller. I think that option can be used by other
> cases in the core code.
There are two factors - a) tuplesorts should to uses only memory, b)
data can be sorted again and again. I'll look on possible tuplesort
modifications on weekend.
> Hitoshi Harada
In response to
pgsql-hackers by date
|Next:||From: Fujii Masao||Date: 2010-10-01 09:13:02|
|Subject: Re: Using streaming replication as log archiving|
|Previous:||From: Dean Rasheed||Date: 2010-10-01 08:35:12|
|Subject: Re: WIP: extensible enums|
pgsql-rrreviewers by date
|Next:||From: Tom Lane||Date: 2010-10-01 13:05:43|
|Subject: Re: wip: functions median and percentile |
|Previous:||From: Hitoshi Harada||Date: 2010-10-01 08:24:23|
|Subject: Re: [HACKERS] top-level DML under CTEs|