Effectively the first column holds the parent id, i.e. the first node in the hireachy. Column 2 holds the child, each subsequent child is a child of the previous...

Sorry the format is a little confusing, the three columns represent the order of the tree.

Please use code below to get a better representation...

create table #original (K_PROJECT int, K_PROJECT2 int)

insert...

Thanks to you both

Hi,

This worked but I have one question that perhaps you might be able to explain.

The #old table has 1000 + records, but when I implement your advice, the table returns...

Sorry for the confusion. That's very helpful, thank you.

I will try implementing this query in the actual query.

Thanks again

The id is a primary key with automated self incrementing identity, so the next child will always be greater than the previous.

Answers available here.... thanks for the input

http://www.sqlservercentral.com/Forums/Topic1201910-391-1.aspx#bm1202127

Wow very nice!!!!

Top answer by far. I've done the same thing but without the .Net instead I used the first function in this link....

http://www.sqlteam.com/article/regular-expressions-in-t-sql

Thanks to all...

Thanks for your input folks...

I'm leading down the regex path first using the link provided and http://www.sqlteam.com/article/regular-expressions-in-t-sql

if this fails then i'll start with Paul's suggestion.

Again, thank you guys...

Hi,

Thanks Paul.

With out sounding like an SOB that's the problem I am having, finding all those that have words within a set distance from each other. The pre-filter is...