Skip site navigation (1)
Skip section navigation (2)
Peripheral Links
Header And Logo
|
Site Navigation
Re: "Big O" notation for postgres?
- From: Richard Huxton <dev(at)archonet(dot)com>
- To: "Jonah H. Harris" <jonah(dot)harris(at)gmail(dot)com>
- Cc: "H. Hall" <hhall1001(at)reedyriver(dot)com>, pgsql-performance(at)postgresql(dot)org
- Subject: Re: "Big O" notation for postgres?
- Date: Wed, 21 May 2008 15:39:54 +0100
- Message-id: <4834343A(dot)8020607(at)archonet(dot)com>
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.
-- Richard Huxton Archonet Ltd
- Follow-Ups:
- Re: "Big O" notation for postgres?
- From: Gregory Stark
- Re: "Big O" notation for postgres?
- References:
- "Big O" notation for postgres?
- From: H. Hall
- Re: "Big O" notation for postgres?
- From: Jonah H. Harris
- "Big O" notation for postgres?
- Prev by Date: Re: "Big O" notation for postgres?
- Next by Date: Re: Posible planner improvement?
- Previous by thread: Re: "Big O" notation for postgres?
- Next by thread: Re: "Big O" notation for postgres?
- Indexes: