<?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: Performance gotcha of MySQL memory tables</title>
	<atom:link href="http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/</link>
	<description>Percona&#039;s MySQL &#38; InnoDB performance and scalability blog</description>
	<lastBuildDate>Sat, 11 Feb 2012 16:45:54 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Jake Drew</title>
		<link>http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/comment-page-1/#comment-809351</link>
		<dc:creator>Jake Drew</dc:creator>
		<pubDate>Fri, 05 Aug 2011 04:37:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/#comment-809351</guid>
		<description>I would love to know your thoughts on the performance of a Engine=Memory table with BTREE used for lookups by primary key when compared to the same values in a C# Dictionary?  Do you expect that the performance would be worse, similar, better?</description>
		<content:encoded><![CDATA[<p>I would love to know your thoughts on the performance of a Engine=Memory table with BTREE used for lookups by primary key when compared to the same values in a C# Dictionary?  Do you expect that the performance would be worse, similar, better?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: peter</title>
		<link>http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/comment-page-1/#comment-483659</link>
		<dc:creator>peter</dc:creator>
		<pubDate>Fri, 20 Feb 2009 23:07:15 +0000</pubDate>
		<guid isPermaLink="false">http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/#comment-483659</guid>
		<description>Coway,

There is nothing as generally representative case.  In this case I was to show the particular behavior of HASH indexes with a lot of rows matching the same value.  In other cases it depends differently of course. 

Note in this case it is not the search which is the problem but delete which is very expensive...</description>
		<content:encoded><![CDATA[<p>Coway,</p>
<p>There is nothing as generally representative case.  In this case I was to show the particular behavior of HASH indexes with a lot of rows matching the same value.  In other cases it depends differently of course. </p>
<p>Note in this case it is not the search which is the problem but delete which is very expensive&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Coway</title>
		<link>http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/comment-page-1/#comment-482611</link>
		<dc:creator>Coway</dc:creator>
		<pubDate>Thu, 19 Feb 2009 19:59:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/#comment-482611</guid>
		<description>Peter,

There is one problem in your test: the data is not representative. The cardinality for column &#039;c&#039; is 1. Thus, there are too many duplicates for the same hash value. Under this situation, B-tree is much better than hash.

If you randomly generate values for c, and increase the selectivity for column &#039;c&#039;, for the search with equal condition, hash should have better performance.</description>
		<content:encoded><![CDATA[<p>Peter,</p>
<p>There is one problem in your test: the data is not representative. The cardinality for column &#8216;c&#8217; is 1. Thus, there are too many duplicates for the same hash value. Under this situation, B-tree is much better than hash.</p>
<p>If you randomly generate values for c, and increase the selectivity for column &#8216;c&#8217;, for the search with equal condition, hash should have better performance.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: dbnewz &#187; Blog Archive &#187; Choisir l&#8217;implÃ©mentation de ses index : &#8220;B-TREE&#8221; ou &#8220;HASH&#8221;, quelles diffÃ©rences ?</title>
		<link>http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/comment-page-1/#comment-300791</link>
		<dc:creator>dbnewz &#187; Blog Archive &#187; Choisir l&#8217;implÃ©mentation de ses index : &#8220;B-TREE&#8221; ou &#8220;HASH&#8221;, quelles diffÃ©rences ?</dc:creator>
		<pubDate>Sun, 18 May 2008 23:12:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/#comment-300791</guid>
		<description>[...] proportionnels Ã  cette redondance sont Ã  prÃ©voir lors des UPDATE et DELETE. Un billet de Peter Zaitsev relate parfaitement ce [...]</description>
		<content:encoded><![CDATA[<p>[...] proportionnels Ã  cette redondance sont Ã  prÃ©voir lors des UPDATE et DELETE. Un billet de Peter Zaitsev relate parfaitement ce [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Propiedad Privada &#187; Blog Archive &#187; MiscelÃ¡nea de enlaces sobre Bases de datos</title>
		<link>http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/comment-page-1/#comment-247241</link>
		<dc:creator>Propiedad Privada &#187; Blog Archive &#187; MiscelÃ¡nea de enlaces sobre Bases de datos</dc:creator>
		<pubDate>Fri, 29 Feb 2008 15:44:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.mysqlperformanceblog.com/2008/02/01/performance-gotcha-of-mysql-memory-tables/#comment-247241</guid>
		<description>[...] Ojo con el tipo de Ã­ndices que defines en las tablas Memory, en algunas circunstancias un Ã­ndice BTREE puede ser hasta un 20000% mÃ¡s rÃ¡pido, ahi es nada. MÃ¡s informaciÃ³n y test en Performance gotcha of MySQL memory tables [...]</description>
		<content:encoded><![CDATA[<p>[...] Ojo con el tipo de Ã­ndices que defines en las tablas Memory, en algunas circunstancias un Ã­ndice BTREE puede ser hasta un 20000% mÃ¡s rÃ¡pido, ahi es nada. MÃ¡s informaciÃ³n y test en Performance gotcha of MySQL memory tables [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

