Home Forums SQL Server 2008 T-SQL (SS2K8) HierarchyID performance problems... Really??? RE: HierarchyID performance problems... Really???

  • April 4, 2013 at 7:42 am

    #1603560

    princerastogi (4/4/2013)

    I used this but only on my Test Box, With small data. I think no problem will be there if we will use indexes for both depth first search and breadth first search as per the requirement.

    Thanks for the feedback. I appreciate it.

    As a bit of sidebar, there's almost never a performance problem with small data. I have code that will build a million row Adjacency List and to truly answer the question, I guess I'm just going to have to test it and find out for sure. Your response also reminds me to test for resources used by indexes no matter what method is used. Thank you.

    --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)