Can anyone give me any insight as to what might be the best way to do the
following: On a table with 500,000 rows, compare every row to every other
row in the table (500,000X500,000 comparisons) in order to do some
similarity analysis between rows of a table. Would it be more efficient to
create two cursors each stepping through the complete table or create 1
cursor that does an unconstrained join? What are the implications of
creating a cursor that would have 500,000x500,000 rows in it? Any
recommendations would be GREATLY appreicated!
Lisa
Received on Mon Jun 22 1998 - 09:42:19 CDT
