| From: | "Steinar H(dot) Gunderson" <sgunderson(at)bigfoot(dot)com> |
|---|---|
| To: | pgsql-performance(at)postgresql(dot)org |
| Subject: | Re: [GENERAL] Creation of tsearch2 index is very slow |
| Date: | 2006-01-20 22:59:32 |
| Message-ID: | 20060120225932.GB27230@uio.no |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general pgsql-performance |
On Fri, Jan 20, 2006 at 05:29:46PM -0500, Ron wrote:
> If the N-dimensional space is Euclidean (any <x, x+1> is the same
> distance apart in dimension x), then finding the farthest pair can be
> done in at least O(n).
That sounds a bit optimistic.
is from 1993, but still it struggles with getting it down to O(n log n)
deterministically, for Euclidian 3-space, and our problem is not Euclidian
(although it still satisfies the triangle inequality, which sounds important
to me) and in a significantly higher dimension...
/* Steinar */
--
Homepage: http://www.sesse.net/
| From | Date | Subject | |
|---|---|---|---|
| Next Message | SunWuKung | 2006-01-20 23:00:49 | standard normal cumulative distribution function |
| Previous Message | Steinar H. Gunderson | 2006-01-20 22:57:51 | Re: [GENERAL] Creation of tsearch2 index is very slow |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2006-01-20 23:22:39 | Re: Creation of tsearch2 index is very slow |
| Previous Message | Steinar H. Gunderson | 2006-01-20 22:57:51 | Re: [GENERAL] Creation of tsearch2 index is very slow |