<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Storing Hierarchical Data in a Relational Database</title>
	<atom:link href="http://blog.thefrontiergroup.com.au/2008/10/storing-hierarchical-data-in-a-relational-database/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.thefrontiergroup.com.au/2008/10/storing-hierarchical-data-in-a-relational-database/</link>
	<description>Your peek inside the collective mind of The Frontier Group</description>
	<lastBuildDate>Tue, 08 May 2012 03:28:54 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.2</generator>
	<item>
		<title>By: mlambie</title>
		<link>http://blog.thefrontiergroup.com.au/2008/10/storing-hierarchical-data-in-a-relational-database/comment-page-1/#comment-36</link>
		<dc:creator>mlambie</dc:creator>
		<pubDate>Fri, 31 Oct 2008 05:33:34 +0000</pubDate>
		<guid isPermaLink="false">http://thefrontiergroup.com.au/blog/?p=117#comment-36</guid>
		<description>I&#039;m using nested sets in a Rails application to represent a hierarchical menu system with great success. I used the &lt;a href=&quot;http://agilewebdevelopment.com/plugins/awesome_nested_set&quot; rel=&quot;nofollow&quot;&gt;awesome_nested_sets&lt;/a&gt; plugin.

This plugin uses a parent_id along with lft and rgt so it&#039;s easy to traverse the tree top-to-bottom, as Mark suggested.</description>
		<content:encoded><![CDATA[<p>I&#8217;m using nested sets in a Rails application to represent a hierarchical menu system with great success. I used the <a href="http://agilewebdevelopment.com/plugins/awesome_nested_set" rel="nofollow">awesome_nested_sets</a> plugin.</p>
<p>This plugin uses a parent_id along with lft and rgt so it&#8217;s easy to traverse the tree top-to-bottom, as Mark suggested.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark W</title>
		<link>http://blog.thefrontiergroup.com.au/2008/10/storing-hierarchical-data-in-a-relational-database/comment-page-1/#comment-35</link>
		<dc:creator>Mark W</dc:creator>
		<pubDate>Fri, 31 Oct 2008 03:05:30 +0000</pubDate>
		<guid isPermaLink="false">http://thefrontiergroup.com.au/blog/?p=117#comment-35</guid>
		<description>I read the same article a few months back when I was designing a schema for managing a hierarchy of climbing locations.  The concern I had was that you need a very robust data access layer. Any corruption in your data could quickly break your entire tree. You can probably forget about running ad-hoc queries from the command line due to the added complexity.  For any non-trivial application, I&#039;d be tempted to additionally store parent references, so that the nested sets data could be rebuilt.  

It&#039;s frustrating that MySQL doesn&#039;t support hierarchical queries - a feature that has been in MS-SQL for several years and Oracle for significantly longer!</description>
		<content:encoded><![CDATA[<p>I read the same article a few months back when I was designing a schema for managing a hierarchy of climbing locations.  The concern I had was that you need a very robust data access layer. Any corruption in your data could quickly break your entire tree. You can probably forget about running ad-hoc queries from the command line due to the added complexity.  For any non-trivial application, I&#8217;d be tempted to additionally store parent references, so that the nested sets data could be rebuilt.  </p>
<p>It&#8217;s frustrating that MySQL doesn&#8217;t support hierarchical queries &#8211; a feature that has been in MS-SQL for several years and Oracle for significantly longer!</p>
]]></content:encoded>
	</item>
</channel>
</rss>

