| From: | Atri Sharma <atri(dot)jiit(at)gmail(dot)com> |
|---|---|
| To: | Robert James <srobertjames(at)gmail(dot)com> |
| Cc: | Postgres General <pgsql-general(at)postgresql(dot)org> |
| Subject: | Re: Longest Common Subsequence in Postgres - Algorithm Challenge |
| Date: | 2013-07-08 13:14:38 |
| Message-ID: | CAOeZVicZFMXCsO930ke7XYAGtviCkmZUsNgh_6zFh3uQ6x5LJA@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
On Mon, Jul 8, 2013 at 6:39 PM, Robert James <srobertjames(at)gmail(dot)com> wrote:
> 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?
>
>
> --
> Sent via pgsql-general mailing list (pgsql-general(at)postgresql(dot)org)
> To make changes to your subscription:
> http://www.postgresql.org/mailpref/pgsql-general
Pl/R is the way to go,IMO.
Or any supported language.
Regards,
Atri
--
Regards,
Atri
l'apprenant
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2013-07-08 13:15:33 | Re: backend hangs at sendto() and can't be terminated |
| Previous Message | Robert James | 2013-07-08 13:09:26 | Longest Common Subsequence in Postgres - Algorithm Challenge |