Click here to Skip to main content
6,634,665 members and growing! (16,333 online)
Email Password   helpLost your password?
Announcements
BullFrog Power
 
Search    
Add to IE Search

Articles by Adam Hurwitz (1 article found)

Average article rating: 4.56

Database

SQL

Depth-wise Ordering for Trees in SQL
Last Updated: 7 Jun 2007   Page Views: 11,221   Rating: 4.56/5    Votes: 3   Popularity: 2.17   Bookmark Count: 20
Licence: The Code Project Open License (CPOL)   
Using a modified Adjacency List model in SQL, can you retrieve a depth-wise ordered subtree?

Adam Hurwitz


Member
Software architect, lead developer, and senior database expert at BIA, an ediscovery and computer forensics company. http://www.biaprotect.com
Check out my tech blog: http://adamhurwitz.blogspot.com/
Location: United States United States


Last Updated 23 Nov 2009
Web18 | 2.2.0175 | Advertise | Privacy
Copyright © CodeProject, 1999-2009
All Rights Reserved. Terms of Use