Re: What databases have taught me
From: Bruno Desthuilliers <onurb_at_xiludom.gro>
Date: Sat, 24 Jun 2006 15:04:29 +0200
Message-ID: <449d385f$0$19181$626a54ce_at_news.free.fr>
>
>
> Transitive closure of a graph.
>
> There are better eways to model trees in SQL than an adjacency list.
> Look up Nested Sets
Date: Sat, 24 Jun 2006 15:04:29 +0200
Message-ID: <449d385f$0$19181$626a54ce_at_news.free.fr>
-CELKO- wrote:
>>>"fermeture transitive d'un graphe". <,
>
>
> Transitive closure of a graph.
>
> There are better eways to model trees in SQL than an adjacency list.
> Look up Nested Sets
I did some years ago. It's an awful kludge. It that's all you have to offer, I prefer to handle the case with client code or even P/SQL.
> and get a copy of TREES & HIERATCHIES IN SQL.
Doing commercial ads and self-promotion on usenet, Mr Celko ?
-- bruno desthuilliers python -c "print '_at_'.join(['.'.join([w[::-1] for w in p.split('.')]) for p in 'onurb_at_xiludom.gro'.split('@')])"Received on Sat Jun 24 2006 - 15:04:29 CEST