On Fri, Jan 20, 2006 at 06:52:37PM -0500, Tom Lane wrote: > It's also worth considering that the entire approach is a heuristic, > really --- getting the furthest-apart pair of seeds doesn't guarantee > an optimal split as far as I can see. Maybe there's some totally > different way to do it. For those of us who don't know what tsearch2/gist is trying to accomplish here, could you provide some pointers? :-) During my mini-literature-search on Google, I've found various algorithms for locating clusters in high-dimensional metric spaces[1]; some of it might be useful, but I might just be misunderstanding what the real problem is. [1] http://ieeexplore.ieee.org/iel5/69/30435/01401892.pdf?arnumber=1401892 , for instance /* Steinar */ -- Homepage: http://www.sesse.net/
