Re: LIMIT/SORT optimization

From: "Simon Riggs" <simon(at)2ndquadrant(dot)com>
To: "Bruce Momjian" <bruce(at)momjian(dot)us>
Cc: "Gregory Stark" <stark(at)enterprisedb(dot)com>, "Heikki Linnakangas" <heikki(at)enterprisedb(dot)com>, "Gregory Stark" <gsstark(at)mit(dot)edu>, "pgsql-patches" <pgsql-patches(at)postgresql(dot)org>
Subject: Re: LIMIT/SORT optimization
Date: 2007-04-08 08:24:13
Message-ID: 1176020653.3623.611.camel@silverbirch.site
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-patches

On Sat, 2007-04-07 at 22:16 -0400, Bruce Momjian wrote:

> > The patch is faster until we hit 100k or 10% of the table, at which
> > point it is the same speed. What is interesting is 1M is also the same
> > speed:

All tests good, AFAICS. Thanks Bruce.

Patch is operating as expected: the common case is considerably faster
and the uncommon case isn't any slower.

--
Simon Riggs
EnterpriseDB http://www.enterprisedb.com

In response to

Browse pgsql-patches by date

  From Date Subject
Next Message Simon Riggs 2007-04-08 08:31:12 Re: Heap page diagnostic/test functions (v2)
Previous Message Marko Kreen 2007-04-08 08:08:35 RESET SESSION v3