Longest Common Subsequence in Postgres - Algorithm Challenge

From: Robert James <srobertjames(at)gmail(dot)com>
To: Postgres General <pgsql-general(at)postgresql(dot)org>
Subject: Longest Common Subsequence in Postgres - Algorithm Challenge
Date: 2013-07-08 13:09:26
Message-ID: CAGYyBghDgxyzFF5AqGoGM8jWKa-hQL-tcMyZvy0bfVjz0BPOQg@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: 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?

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Atri Sharma 2013-07-08 13:14:38 Re: Longest Common Subsequence in Postgres - Algorithm Challenge
Previous Message Merlin Moncure 2013-07-08 12:35:39 Re: backend hangs at sendto() and can't be terminated