The Performance of Traversing a SQL Hierarchy
Dwain Camps shows that, depending on the size and characteristics of some hierarchical data, six different methods of traversal can each be the fastest at some point. He illustrates the danger in generalizing from just one set of test data, and that it's foolish to assume that just because SQL code looks neat, it will perform well.
2014-05-14
2,625 reads

