From: | Igor Neyman <ineyman(at)perceptron(dot)com> |
---|---|
To: | Don Parris <parrisdc(at)gmail(dot)com>, "pgsql-sql(at)postgresql(dot)org" <pgsql-sql(at)postgresql(dot)org> |
Subject: | Re: Using Ltree For Hierarchical Structures |
Date: | 2013-02-26 14:01:58 |
Message-ID: | A76B25F2823E954C9E45E32FA49D70EC08F7BBD8@mail.corp.perceptron.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-sql |
From: Don Parris [mailto:parrisdc(at)gmail(dot)com]
Sent: Sunday, February 24, 2013 5:21 PM
To: pgsql-sql(at)postgresql(dot)org
Subject: Using Ltree For Hierarchical Structures
Hi all,
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.
Regards,
Don
It's all "in the eyes of beholder".
IMHO, recursive CTEs are perfect for hierarchical structures, and much cleaner than 2-table design using ltree, that you show in the blog.
Regards,
Igor Neyman
From | Date | Subject | |
---|---|---|---|
Next Message | Misa Simic | 2013-02-26 16:14:04 | Re: Using Ltree For Hierarchical Structures |
Previous Message | Ben Morrow | 2013-02-26 02:46:54 | Re: Creating a new database with a TEMPLATE did not work |