On Fri, Jan 20, 2006 at 04:50:17PM -0500, Tom Lane wrote:
> I wonder if there is a way to improve on that.
Ooh, the farthest pair problem (in an N-dimensional vector space, though).
I'm pretty sure problems like this has been studied quite extensively in the
literature, although perhaps not with the same norm. It's known under both
"farthest pair" and "diameter", and probably others. I'm fairly sure it
should be solvable in at least O(n log n).
/* Steinar */
In response to
pgsql-performance by date
|Next:||From: Ron||Date: 2006-01-20 22:29:46|
|Subject: Re: [GENERAL] Creation of tsearch2 index is very slow|
|Previous:||From: Jignesh K. Shah||Date: 2006-01-20 22:13:58|
|Subject: Re: Sudden slowdown of Pg server|
pgsql-general by date
|Next:||From: Chris Browne||Date: 2006-01-20 22:23:59|
|Subject: Re: Page-Level Encryption|
|Previous:||From: Dominic J. Eidson||Date: 2006-01-20 22:11:51|
|Subject: Strange errors after some DB problems|