On Tue, Apr 21, 2009 at 12:11:26PM +0000, Jasen Betts wrote: > > Is there a way to acheive the above result without a sort and without a > > self-join? > > anyway you could possibly write an agregate function that returns a > copy of the row with the highest id? Put that way it sounds like something for a window function. Not sure if they can use a HashAggrgate though. Have a nice day, -- Martijn van Oosterhout <kleptog@xxxxxxxxx> http://svana.org/kleptog/ > Please line up in a tree and maintain the heap invariant while > boarding. Thank you for flying nlogn airlines.
Attachment:
signature.asc
Description: Digital signature
