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

Jeff Moden (8/10/2009)

---

Ummmm.... does SQL Server's CHECKSUM use the SHA1 algorithm because I was talking about that CHECKSUM. Obviously that doesn't take 6000 to 12000 years to happen because...

Jeff Moden (8/9/2009)

---

Paul White (8/8/2009)

---

HashBytes (perhaps including the PK as a salt) is a good choice if the task is to detect changes.

CHECKSUM is quick and efficient for creating hash...

What have you tried so far?

Well, this will bump everyone else off and keep them off until you reset that database to MULTI_USER mode:

ALTER DATABASE YourDBName SET SINGLE_USER WITH ROLLBACK IMMEDIATE;

Wow, nice tip! I wonder why I never noticed it before ...?

GilaMonster (8/10/2009)

---

Please note I'm asking for an article review, either a technical review or...

FYI: the BOL link posted after the explanation does not confirm anything said in the explanation.

Bob Hovious (8/7/2009)

---

Warning. Don't click on the link above. Save it and open it with notepad or some other editor first. I'm...

Hmm, better go with minutes.

Oops, that's still too big...

You are getting an integer overflow because you are trying to count milliseconds since 1900.

Try this query:

SELECT 1000 * 3600*24 * 365.25*(2009-1900)

Use seconds instead.

Yep, sure it works. I've got both on my laptop right now.

I am no admin, but the only "trick" that I know of is to make sure that you...

Dang, someone told me last year what causes that and I can't remember ... 🙁

chris.pols (8/5/2009)

---

Got some more efficient code for an FYI:

SQL = "SELECT TOP 10 X.differential FROM ( " _

& " SELECT...