| From: | Thomas Kellerer <spam_eater(at)gmx(dot)net> |
|---|---|
| To: | pgsql-sql(at)postgresql(dot)org |
| Subject: | Re: Using Ltree For Hierarchical Structures |
| Date: | 2013-02-26 18:43:32 |
| Message-ID: | kgivo7$rg4$1@ger.gmane.org |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-sql |
Don Parris wrote on 24.02.2013 23:20:
> With many thanks to Misa and others who helped out with my question
> about working with hierarchical data, I have now written a blog post
> on how I implemented the ltree module to solve my problem.
>
> http://dcparris.net/2013/02/24/using-ltree-hierarchical-postgresql/
>
> Frankly, if you work with hierarchical data, I'm not sure I could
> recommend it strongly enough. I should think that even experienced,
> advanced SQL gurus would appreciate the simplicity ltree offers, when
> compared to the ugly table designs and recursive queries in order to
> work with hierarchical structures.
>
> I really hope this blog post will help others in the same boat.
>
How do you ensure referential integrity with this approach?
(i.e. make sure that all elements from the path column actually point to an existing category)
Thomas
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Igor Neyman | 2013-02-26 19:30:27 | Re: Using Ltree For Hierarchical Structures |
| Previous Message | Don Parris | 2013-02-26 18:22:58 | Re: Using Ltree For Hierarchical Structures |