Home Forums Article Discussions Article Discussions by Author Discuss Content Posted by Jeff Moden Hidden RBAR: Counting with Recursive CTE's RE: Hidden RBAR: Counting with Recursive CTE's

  • August 8, 2011 at 12:28 pm

    #1365454

    Sir Slicendice (8/8/2011)

    But just because it's recursive doesn't necessarily mean it's slow!

    -frank

    Nor did I say so in the article. 😉 I absolutely agree and that's why I limited the slowness problem to these types of "counting" rCTE's. Even the title of the article reflects that fact.

    It is good, though, to emphasize the fact that I was only talking about Counting rCTE's in the article, so thanks for bringing it up, Frank. I have to admit , though... although While Loops and rCTE's take turns winning, I generally try to avoid both in favor of set-based solutions.

    --Jeff Moden

    RBAR is pronounced "ree-bar" and is a "Modenism" for Row-By-Agonizing-Row.
    First step towards the paradigm shift of writing Set Based code:
    ________Stop thinking about what you want to do to a ROW... think, instead, of what you want to do to a COLUMN.

    Change is inevitable... Change for the better is not.

    Helpful Links:
    How to post code problems
    How to Post Performance Problems
    Create a Tally Function (fnTally)