Re: Merge rows based on Levenshtein distance

Поиск
Список
Период
Сортировка
От mongoose
Тема Re: Merge rows based on Levenshtein distance
Дата
Msg-id 1417633214924-5829146.post@n5.nabble.com
обсуждение исходный текст
Ответ на Re: Merge rows based on Levenshtein distance  (Michael Nolan <htfoot@gmail.com>)
Ответы Re: Merge rows based on Levenshtein distance  (Michael Nolan <htfoot@gmail.com>)
Список 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.


В списке pgsql-general по дате отправления:

Предыдущее
От: mongoose
Дата:
Сообщение: Re: Merge rows based on Levenshtein distance
Следующее
От: Kris Deugau
Дата:
Сообщение: INSERT to partitioned table doesn't return row count