Pure SQL transitive closure with LEVEL

From: Serg <gerg_at_ncom.ru>
Date: 25 Nov 2002 04:45:49 -0800
Message-ID: <a9680411.0211250445.267a3c8f_at_posting.google.com>

Hi

I need pure SQL code to compute transitive closure from adjacency matrix, say table X(ParentID, ChildID). I managed to compute all ancestor/predecessor pairs, but couldn't find the way to get a distance (level) between them in same query.

regards
Serg Levin
gerg_at_ncom.ru Received on Mon Nov 25 2002 - 13:45:49 CET

This message: [ Message body ]
Next message: Shaheer: "Help: Oracle Workflow Mailer"
Previous message: Karsten Farrell: "Re: Problem for experts: disconnection to server"
Next in thread: Sagi: "Re: Pure SQL transitive closure with LEVEL"
Reply: Damjan S. Vujnovic: "Re: Pure SQL transitive closure with LEVEL"
Reply: Serg: "Re: Pure SQL transitive closure with LEVEL"
Reply: Sagi: "Re: Pure SQL transitive closure with LEVEL"

Contemporary messages sorted: [ by date ] [ by thread ] [ by subject ] [ by author ]

Original text of this message