Re: Planning aggregates which require sorted or distinct

Поиск
Список
Период
Сортировка
От Alvaro Herrera
Тема Re: Planning aggregates which require sorted or distinct
Дата
Msg-id 20070120121815.GN26080@alvh.no-ip.org
обсуждение исходный текст
Ответ на Re: Planning aggregates which require sorted or distinct  ("Simon Riggs" <simon@2ndquadrant.com>)
Ответы Re: Planning aggregates which require sorted or distinct  (Gregory Stark <stark@enterprisedb.com>)
Список pgsql-hackers
Simon Riggs wrote:

> I'm working on modifying Tuplestore that will allow you to store the
> last N tuples, rather than all previous input. This is specifically
> designed to allow Merge Join to do Mark/Restore without materializing
> the whole sort set. This can also be used to materialize Windows (i.e.
> <window clause> in SQL:2003), so you can store the current row plus n
> PRECEDING and/or n FOLLOWING rows as appropriate.

Interesting.  This could also be used to implement the "partial sort"
stuff that Oleg is so interested in, and in which I believe Greg Stark
was also interested.

-- 
Alvaro Herrera                                http://www.CommandPrompt.com/
PostgreSQL Replication, Consulting, Custom Development, 24x7 support


В списке pgsql-hackers по дате отправления:

Предыдущее
От: "Simon Riggs"
Дата:
Сообщение: Re: Planning aggregates which require sorted or distinct
Следующее
От: Gavin Sherry
Дата:
Сообщение: Re: Planning aggregates which require sorted or distinct