Re: wip: functions median and percentile
От | Pavel Stehule |
---|---|
Тема | Re: wip: functions median and percentile |
Дата | |
Msg-id | AANLkTinqF5SKmFawSV+Nro3DLbY9wUJ_TNuq2ZWYFAmS@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: wip: functions median and percentile (Hitoshi Harada <umi.tanuki@gmail.com>) |
Список | pgsql-hackers |
Hello 2010/10/1 Hitoshi Harada <umi.tanuki@gmail.com>: > 2010/9/26 Pavel Stehule <pavel.stehule@gmail.com>: >> Hello, >> >> 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. >> >> Comments? > > 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. Pavel > > Regards, > > > -- > Hitoshi Harada >
В списке pgsql-hackers по дате отправления: