Longest Common Subsequence in Postgres - Algorithm Challenge

Поиск
Список
Период
Сортировка
От Robert James
Тема Longest Common Subsequence in Postgres - Algorithm Challenge
Дата
Msg-id CAGYyBghDgxyzFF5AqGoGM8jWKa-hQL-tcMyZvy0bfVjz0BPOQg@mail.gmail.com
обсуждение исходный текст
Ответы Re: Longest Common Subsequence in Postgres - Algorithm Challenge  (Atri Sharma <atri.jiit@gmail.com>)
Re: Longest Common Subsequence in Postgres - Algorithm Challenge  (hubert depesz lubaczewski <depesz@depesz.com>)
Список pgsql-general
Дерево обсуждения 
I have two relations, where each relation has two fields, one
indicating a name and one indicating a position.  That is, each
relation defines a sequence.

I need to determine their longest common subsequence.  Yes, I can do
this by fetching all the data into Java (or any other language) and
computing it using the standard LCS dynamic programming language.  But
I'd like to stay within Postgres.  Is there any way to do this?

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

Предыдущее
От: Merlin Moncure
Дата:
Сообщение: Re: backend hangs at sendto() and can't be terminated
Следующее
От: Atri Sharma
Дата:
Сообщение: Re: Longest Common Subsequence in Postgres - Algorithm Challenge