On Wed, May 07, 2014 at 04:07:22PM -0500, John McKown wrote:
> On Wed, May 7, 2014 at 3:36 PM, Randy Westlund wrote:
>
> > I have a table with N (over 35k) rows. I need to compare each of
> > those elements to every other element in the list, which is the
> > handsha
I have a table with N (over 35k) rows. I need to compare each of
those elements to every other element in the list, which is the
handshake problem.
This results in a symmetric matrix (an adjacency matrix for an
undirected graph). Because all relations are symmetric, I only need to
store the uppe
