Re: sorting problem

From: Bruno Wolff III <bruno(at)wolff(dot)to>
To: Greg Stark <gsstark(at)mit(dot)edu>
Cc: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, pgsql-general(at)postgresql(dot)org
Subject: Re: sorting problem
Date: 2004-12-17 21:12:18
Message-ID: 20041217211218.GA2119@wolff.to
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

On Fri, Dec 17, 2004 at 15:36:58 -0500,
Greg Stark <gsstark(at)mit(dot)edu> wrote:
>
> Isn't that still nlog(n)? In the end you're going to have read in every page
> of the index including all those non-leaf pages. Aren't there nlog(n) pages?

The depth of the tree is log N, but there are only N nodes. I think you
can treat the amount of information at each node as constant.

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Jerry LeVan 2004-12-17 21:12:44 Re: OSX 10.3.7 broke Postgresql 8.0.0b5?
Previous Message Tom Lane 2004-12-17 21:09:28 Re: analyze-error: "cannot compare arrays of different element types" revisited