Skip site navigation (1) Skip section navigation (2)

Re: SQL99 Hierarchical queries

From: Josh Berkus <josh(at)agliodbs(dot)com>
To: pgsql-hackers(at)postgresql(dot)org
Subject: Re: SQL99 Hierarchical queries
Date: 2005-03-01 06:52:17
Message-ID: (view raw, whole thread or download thread mbox)
Lists: pgsql-hackers

> I'm curious what kind of performance differences there would be over
> using something like the nested-set model?
> Would this be faster, or slower?

The answer is "yes".    ;-)

Which tree structures you use depends on what you're trying to accomplish and 
what your use case is.   There are some structures (for example, heirarchical 
org charts) for which nested sets can't be beat.   There are plenty of 
reasons to implement other tree structures, such as graphs, cycles, and 
delimited lists depending on what you're trying to depict.   

What WITH is going to "replace", if anything, is the simple adjacency list 

Josh Berkus
Aglio Database Solutions
San Francisco

pgsql-hackers by date

Next:From: Tom LaneDate: 2005-03-01 07:33:48
Subject: Re: bitmap AM design
Previous:From: Tom LaneDate: 2005-03-01 06:05:04
Subject: Re: mysterious log output

Privacy Policy | About PostgreSQL
Copyright © 1996-2018 The PostgreSQL Global Development Group