Re: DAGs and recursive queries
От | Jeff Davis |
---|---|
Тема | Re: DAGs and recursive queries |
Дата | |
Msg-id | 1190917877.5943.111.camel@dogma.ljc.laika.com обсуждение исходный текст |
Ответ на | Re: DAGs and recursive queries (Gregory Stark <stark@enterprisedb.com>) |
Ответы |
Re: DAGs and recursive queries
|
Список | pgsql-general |
On Wed, 2007-09-26 at 16:54 +0100, Gregory Stark wrote: > "paul.dorman" <paul.dorman@gmail.com> writes: > > > Hi everyone, > > > > I would like to know the best way to implement a DAG in PostgreSQL. I > > understand there has been some talk of recursive queries, and I'm > > wondering if there has been much progress on this. > > The ANSI recursive queries didn't make it into 8.3. I still hope it makes 8.4. > > You could check out the tablefunc contrib which includes a function called > connectby() which implements a kind of recursive query. > > Alternatively you might look at the ltree contrib module but that doesn't work > the way you describe. It denormalizes the data for very fast but less flexible Ltree seems like it might be a good option for him. What doesn't it do that he needs? I am also interested in graphs and trees in relational databases. Can you recommend any good books? I particularly like CJ Date as an author, but I can't find anything by him that specifically addresses this topic. Also, how exactly is the database denormalized by using ltree? Regards, Jeff Davis
В списке pgsql-general по дате отправления: