Alastair McKinley <[email protected]> writes:
> I know that Cube in it's current form isn't suitable for nearest-neighbour
> searching these vectors in their raw form (I have tried recompilation with
> higher CUBE_MAX_DIM myself), but conceptually kNN GiST searches using Cubes
> can be useful for these applications. There are other pre-processing
> techniques that can be used to improved the speed of the search, but it still
> ends up with a kNN search in a high-ish dimensional space.
Is there a way to fix the numerical instability involved? If we could do
that, then we'd definitely have a use-case justifying the work to make
cube toastable.
regards, tom lane
