Performant way to clone rather large subtree in database?

I'm assuming you're doing all the cloning in your . NET app which is causing a lot of roundtrips to the database server?

I'm assuming you're doing all the cloning in your . NET app which is causing a lot of roundtrips to the database server? First make sure you're doing all your cloning on the database and avoiding these roundtrips.It should be possible to do exactly what you are doing, but using a recursive stored procedure, just by rewriting your current C# algorithm in SQL.

You should see a big performance boost. Someone cleverer than me might say it can be done using a single CTE query but this post seems to suggest that's not possible. Certainly, I can't see how you'd do this and preserve the relationships between the new ids.

Your assumption is right and your suggestion sounds really great! I'll sleep a night over it and think about how to implement. Thanks a lot!

– Uwe Keim Aug 25 '11 at 19:47.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.