A recursive dilema???

[AndyBrew70]

Hi All Background ---------- I have a database table namely tblSection that stores sections that have parent child relationships e.g. Section 1 | |--Section 2 | |--Section 3 | | | |--Section 4 | |--Section 5 | Section 6 The column structure for this table is: SectionGUID uniqueidentifier PK ParentGUID uniqueidentifier ALLOW NULL Title nvarchar(100) So my root level records are anything where ParentGUID IS NULL and the remaining records can have variable levels of nested children. My Problem ---------- So what would people suggest with regards handling this structure within SQL for example a typical request is to return all sections below a specific node within the hierarchy? Currently I deal with the scenarios I have by extracting all folders into a single System.Data.DataTable object and then traverse the tree within my code which is OK for certain types of process but now I am looking at more number crunching type processes that approach is slow and cumbersome :( Thanks in advance Andy

[pmarfleet]

In SQL Server 2005, you can use Common Table Expressions[^] to perform recursive operations.

Paul Marfleet "No, his mind is not for rent To any God or government" Tom Sawyer - Rush

[AndyBrew70]

Hi Unfortunately my client is on SQL 2000 so thats a no go, however I found this article during my investigations and with a bit of tweaking works a treat for me :) http://www.vbforums.com/showthread.php?t=366078