<?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: MySQL: Enforcing long unique BLOB / TEXT columns with UNIQUE INDEX</title>
	<atom:link href="http://billauer.se/blog/2020/12/mysql-unique-index-blob-text/feed/" rel="self" type="application/rss+xml" />
	<link>https://billauer.se/blog/2020/12/mysql-unique-index-blob-text/</link>
	<description>Anything I found worthy to write down.</description>
	<lastBuildDate>Thu, 26 Mar 2026 13:15:15 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.2</generator>
	<item>
		<title>By: eli</title>
		<link>https://billauer.se/blog/2020/12/mysql-unique-index-blob-text/comment-page-1/#comment-1560</link>
		<dc:creator>eli</dc:creator>
		<pubDate>Wed, 15 Dec 2021 09:03:25 +0000</pubDate>
		<guid isPermaLink="false">https://billauer.se/blog/?p=6201#comment-1560</guid>
		<description>The question is how large system and what probability is acceptable. I Googled around a bit and found this:

http://web.archive.org/web/20110725085124/http://bitcache.org/faq/hash-collision-probabilities

If that&#039;s true, the probability for a hash collision is most likely negligible for any realistic database.</description>
		<content:encoded><![CDATA[<p>The question is how large system and what probability is acceptable. I Googled around a bit and found this:</p>
<p><a href="http://web.archive.org/web/20110725085124/http://bitcache.org/faq/hash-collision-probabilities" rel="nofollow">http://web.archive.org/web/20110725085124/http://bitcache.org/faq/hash-collision-probabilities</a></p>
<p>If that&#8217;s true, the probability for a hash collision is most likely negligible for any realistic database.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Xiaotian Guo</title>
		<link>https://billauer.se/blog/2020/12/mysql-unique-index-blob-text/comment-page-1/#comment-1559</link>
		<dc:creator>Xiaotian Guo</dc:creator>
		<pubDate>Wed, 15 Dec 2021 01:08:43 +0000</pubDate>
		<guid isPermaLink="false">https://billauer.se/blog/?p=6201#comment-1559</guid>
		<description>Eli, bumped into this post while researching similar topic - The way you implemented hash would not work actually. You will need to consider hash collision, otherwise your implementation will reject legit unique entries, although the chances are low, but it exists especially with a very large scale system.</description>
		<content:encoded><![CDATA[<p>Eli, bumped into this post while researching similar topic &#8211; The way you implemented hash would not work actually. You will need to consider hash collision, otherwise your implementation will reject legit unique entries, although the chances are low, but it exists especially with a very large scale system.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
