• Paul White (8/10/2009)


    RBarryYoung (8/10/2009)


    To clarify: HashBytes w/ SHA1 is nigh-unbreakable.

    Hey Barry,

    On the other hand, it is relatively slow, only works on strings, and returns varbinary(8000).

    If the task is to detect changes in a row of data, would you use HashBytes (SHA1) alone?

    Paul

    In Lowell's example, it also turned a 13 byte string into a 20 byte Varbinary so it's expensive, too.

    But, I believe that Barry's point was simply that it is unbreakable... not like CHECKSUM at all. 🙂

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