<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	>
<channel>
	<title>Comments on: Applications using Hashing with SQL Server 2005/2008</title>
	<atom:link href="http://www.jimmcleod.net/blog/index.php/2009/04/23/applications-using-hashing-with-sql-server-20052008/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.jimmcleod.net/blog/index.php/2009/04/23/applications-using-hashing-with-sql-server-20052008/</link>
	<description>Musings about SQL, databases, and my world in general...</description>
	<pubDate>Thu, 09 Sep 2010 11:52:00 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.7</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Jim</title>
		<link>http://www.jimmcleod.net/blog/index.php/2009/04/23/applications-using-hashing-with-sql-server-20052008/comment-page-1/#comment-17406</link>
		<dc:creator>Jim</dc:creator>
		<pubDate>Wed, 13 Jan 2010 10:52:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.jimmcleod.net/blog/index.php/2009/04/23/applications-using-hashing-with-sql-server-20052008/#comment-17406</guid>
		<description>Hi Suranga,

Unfortunately, Hashbytes() only gives you two choices - a 16 character hash (128 bit), or a 20 character hash (160 bit).  You may be able to find a different hashing algorithm on the Internet that only uses 10 bytes, or you can use a 128 bit algorithm and simply ignore the extra 6 bytes.  Regardless of whether you use a different algorithm or trim a longer one down, you are more likely to encounter a hash collision, simply due to the fewer number of combinations that can be made.   In practice, however, you may never encounter a collision, but you should have some way of resolving collisions.</description>
		<content:encoded><![CDATA[<p>Hi Suranga,</p>
<p>Unfortunately, Hashbytes() only gives you two choices - a 16 character hash (128 bit), or a 20 character hash (160 bit).  You may be able to find a different hashing algorithm on the Internet that only uses 10 bytes, or you can use a 128 bit algorithm and simply ignore the extra 6 bytes.  Regardless of whether you use a different algorithm or trim a longer one down, you are more likely to encounter a hash collision, simply due to the fewer number of combinations that can be made.   In practice, however, you may never encounter a collision, but you should have some way of resolving collisions.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Suranga</title>
		<link>http://www.jimmcleod.net/blog/index.php/2009/04/23/applications-using-hashing-with-sql-server-20052008/comment-page-1/#comment-17399</link>
		<dc:creator>Suranga</dc:creator>
		<pubDate>Wed, 13 Jan 2010 08:08:11 +0000</pubDate>
		<guid isPermaLink="false">http://www.jimmcleod.net/blog/index.php/2009/04/23/applications-using-hashing-with-sql-server-20052008/#comment-17399</guid>
		<description>Sir I want to know above hash value length,How to limit

For Ex;
Always keep the hashvalue with 10 characters</description>
		<content:encoded><![CDATA[<p>Sir I want to know above hash value length,How to limit</p>
<p>For Ex;<br />
Always keep the hashvalue with 10 characters</p>
]]></content:encoded>
	</item>
</channel>
</rss>
