Re: Status of DISTINCT-by-hashing work
От | Hitoshi Harada |
---|---|
Тема | Re: Status of DISTINCT-by-hashing work |
Дата | |
Msg-id | e08cc0400808060740y5456eb96u8676b096ffba8285@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: Status of DISTINCT-by-hashing work (Tom Lane <tgl@sss.pgh.pa.us>) |
Ответы |
Re: Status of DISTINCT-by-hashing work
|
Список | pgsql-hackers |
2008/8/6 Tom Lane <tgl@sss.pgh.pa.us>: > "Hitoshi Harada" <umi.tanuki@gmail.com> writes: >> In my patch nodeWindow.c, some functions reach for its parent state >> node to get info of sort keys by using fcinfo->context. This works but >> is completely ugly. > > Isn't that the same thing nodeAgg does: pass its AggState to aggregate > functions? I don't see anything ugly about it --- at least, any > alternative you care to name is likely to be far worse. Correct. I learned that method from nodeAgg. What I meant was that window functions reach for plan node and its sort keys through winstate->ss.ps. The mechanism is not ugly but some macros or exposed API seem more comfortable, especially if thinking about formulating window functions as user-defined functions. Regards, -- Hitoshi Harada
В списке pgsql-hackers по дате отправления: