> I'd like advices about an idea I add to resolve a problem. thanks to
> you in advance for yours answers.
[quoted text clipped - 14 lines]
> Do you think that is a good idea ? Is checksum a quick function or
> not ?.

Signature
Erland Sommarskog, SQL Server MVP, esquel@sommarskog.se
Books Online for SQL Server 2005 at
http://www.microsoft.com/technet/prodtechnol/sql/2005/downloads/books.mspx
Books Online for SQL Server 2000 at
http://www.microsoft.com/sql/prodinfo/previousversions/books.mspx
> > I'd like advices about an idea I add to resolve a problem. thanks to
> > you in advance for yours answers.
[quoted text clipped - 18 lines]
> based on XOR, and they would too often say a row is unchanged when it
> has not. It would be a lot safer to compare all columns?
> Exactly how do update your tables? To blow all existing data away and
> reload, or do you INSERT new, update existing ones etc? In such case a
[quoted text clipped - 8 lines]
>
> - Afficher le texte des messages précédents -
Hello,
I read on the msdn website that BINARY_CHECKSUM can be used to detect
changes to a row of a table.
To update my current tables, I truncate and after I insert the new
datas.
What do you call a timestamp ? How timestamp could work for me ?
Thanks,
--
K
Erland Sommarskog - 30 May 2007 22:57 GMT
> I read on the msdn website that BINARY_CHECKSUM can be used to detect
> changes to a row of a table.
> To update my current tables, I truncate and after I insert the new
> datas.
> What do you call a timestamp ? How timestamp could work for me ?
If you truncate and insert, timestamp is not going help you. A timestamp
column is automatically updated when a column is updated with a database-
unique monotonically increasing value. So if you had updated only rows that
had changed, and inserted new ones, you could have saved the current
timestamp value when you started, and then all rows with a higher timestamp
value would have been new.
But since you truncate and re-insert, all timestamp values will be higher
when you started.
As I recall binary_checksum() returns a 32-bit integer. If your tables
are wide, this means that collisions will not at all be unlikely. Note
also that binary_checksum ignores some data types entirely.
While more boring to code, I would recommend that you make a comparison
column by column.

Signature
Erland Sommarskog, SQL Server MVP, esquel@sommarskog.se
Books Online for SQL Server 2005 at
http://www.microsoft.com/technet/prodtechnol/sql/2005/downloads/books.mspx
Books Online for SQL Server 2000 at
http://www.microsoft.com/sql/prodinfo/previousversions/books.mspx