Jonah H. Harris wrote:
> On Wed, May 21, 2008 at 10:10 AM, H. Hall <hhall1001(at)reedyriver(dot)com> wrote:
>> Does anyone know if there is a source that provides "Big O" notation for
>> postgres's aggregate functions and operations? For example is count(*) =
>> O(1) or O(n)?
> I don't know of any document containing the complexity of each
> aggregate, but it's sometimes left as a comment in the souce code.
Recent max() and min() can be O(n) or O(1) depending on the where-clause
and presence of an index too, just to muddy the waters.
In response to
pgsql-performance by date
|Next:||From: PFC||Date: 2008-05-21 16:18:27|
|Subject: Re: Posible planner improvement?|
|Previous:||From: Jonah H. Harris||Date: 2008-05-21 14:28:59|
|Subject: Re: "Big O" notation for postgres?|