Re: Merge rows based on Levenshtein distance

From: mongoose <akarargyris(at)gmail(dot)com>
To: pgsql-general(at)postgresql(dot)org
Subject: Re: Merge rows based on Levenshtein distance
Date: 2014-12-03 19:00:14
Message-ID: 1417633214924-5829146.post@n5.nabble.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Hi Mike,

I was planning to do something like David suggested: I would sort the rows
based on name and then I would use a window (i.e. 100 rows) to compare each
individual name to the previous 100. All I want to do is create groups of
similar rows based on some criteria.

--
View this message in context: http://postgresql.nabble.com/Merge-rows-based-on-Levenshtein-distance-tp5828841p5829146.html
Sent from the PostgreSQL - general mailing list archive at Nabble.com.

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Kris Deugau 2014-12-03 19:19:47 INSERT to partitioned table doesn't return row count
Previous Message mongoose 2014-12-03 18:55:49 Re: Merge rows based on Levenshtein distance