Re: "Big O" notation for postgres?
От | Jonah H. Harris |
---|---|
Тема | Re: "Big O" notation for postgres? |
Дата | |
Msg-id | 36e682920805210728p4fa6c12ft592b1045cbae9dfd@mail.gmail.com обсуждение исходный текст |
Ответ на | "Big O" notation for postgres? ("H. Hall" <hhall1001@reedyriver.com>) |
Ответы |
Re: "Big O" notation for postgres?
|
Список | pgsql-performance |
On Wed, May 21, 2008 at 10:10 AM, H. Hall <hhall1001@reedyriver.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.harris@enterprisedb.com Edison, NJ 08837 | http://www.enterprisedb.com/
В списке pgsql-performance по дате отправления: