| From: | "Richard Broersma" <richard(dot)broersma(at)gmail(dot)com> |
|---|---|
| To: | "Ian Sillitoe" <ian(dot)sillitoe(at)googlemail(dot)com> |
| Cc: | pgsql-general(at)postgresql(dot)org |
| Subject: | Re: (FAQ?) JOIN condition - 'WHERE NULL = NULL' |
| Date: | 2008-04-02 19:08:16 |
| Message-ID: | 396486430804021208i568094f7lee1fd1e7db1f7f7b@mail.gmail.com |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
On Wed, Apr 2, 2008 at 11:43 AM, Ian Sillitoe
<ian(dot)sillitoe(at)googlemail(dot)com> wrote:
> I completely take your points - so maybe I should be asking for advice on
> database design instead.
There are a couple of choice you can use:
First is the PostgreSQL contribe Module Ltree:
http://www.postgresql.org/docs/current/static/ltree.html
There is the common adjancy list model:
http://www.sqlsummit.com/AdjacencyList.htm
Celko's Nested set model: { probably provides the most functionality
but with hi costs for INSERT/UPDATE ops)
http://www.intelligententerprise.com/001020/celko.jhtml
and Lastly the Path enurmation model:
http://www.onlamp.com/pub/a/onlamp/2004/08/05/hierarchical_sql.html
One of these model should hopefully be a best fit for you.
--
Regards,
Richard Broersma Jr.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Scott Marlowe | 2008-04-02 19:21:04 | Re: Problem with planner choosing nested loop |
| Previous Message | Harald Fuchs | 2008-04-02 19:06:39 | Re: Problem with planner choosing nested loop |