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.
IIRC, COUNT (non-distinct) is currently O(n), where n also includes
evaluation of tuples not represented in the final count (due to
Postgres' MVCC design).
Jonah H. Harris, Sr. Software Architect | phone: 732.331.1324
EnterpriseDB Corporation | fax: 732.331.1301
499 Thornall Street, 2nd Floor | jonah(dot)harris(at)enterprisedb(dot)com
Edison, NJ 08837 | http://www.enterprisedb.com/
In response to
pgsql-performance by date
|Next:||From: Richard Huxton||Date: 2008-05-21 14:39:54|
|Subject: Re: "Big O" notation for postgres?|
|Previous:||From: H. Hall||Date: 2008-05-21 14:10:53|
|Subject: "Big O" notation for postgres?|