<?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 comparison of Repair by Sorting or by Keycache</title>
	<atom:link href="http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/feed/" rel="self" type="application/rss+xml" />
	<link>http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/</link>
	<description>Everything In Life Is Random! (Personal and Work)</description>
	<lastBuildDate>Sat, 19 May 2012 00:06:06 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Мой конфиг my.cnf для быстрого восстановления таблиц &#171; IT remarks</title>
		<link>http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/comment-page-1/#comment-13307</link>
		<dc:creator>Мой конфиг my.cnf для быстрого восстановления таблиц &#171; IT remarks</dc:creator>
		<pubDate>Wed, 11 Apr 2012 08:14:21 +0000</pubDate>
		<guid isPermaLink="false">http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/#comment-13307</guid>
		<description>[...] По этому поводу, есть хороше сранение тут: Performance comparison of Repair by Sorting or by Keycache [...]</description>
		<content:encoded><![CDATA[<p>[...] По этому поводу, есть хороше сранение тут: Performance comparison of Repair by Sorting or by Keycache [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tuning MySQL : Case Study OBVOC/OBHUNTER</title>
		<link>http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/comment-page-1/#comment-13229</link>
		<dc:creator>Tuning MySQL : Case Study OBVOC/OBHUNTER</dc:creator>
		<pubDate>Sat, 17 Sep 2011 05:44:36 +0000</pubDate>
		<guid isPermaLink="false">http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/#comment-13229</guid>
		<description>[...] พังเดี้ยงได้ อาจะเพิ่มเติมได้ที่ ลิงค์นี้ระหว่าง config มั่วๆถ้าไม่ set connection timeout [...]</description>
		<content:encoded><![CDATA[<p>[...] พังเดี้ยงได้ อาจะเพิ่มเติมได้ที่ ลิงค์นี้ระหว่าง config มั่วๆถ้าไม่ set connection timeout [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bing</title>
		<link>http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/comment-page-1/#comment-10369</link>
		<dc:creator>Bing</dc:creator>
		<pubDate>Fri, 16 Jul 2010 15:25:44 +0000</pubDate>
		<guid isPermaLink="false">http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/#comment-10369</guid>
		<description>I figured it out with help from others http://forums.mysql.com/read.php?21,375635,375939#msg-375939

It is because myisam_sort_buffer_size was not set properly. Apparently, there is one more thing you need to take into consideration when Repairing a MyISAM.

Thanks,

Bing</description>
		<content:encoded><![CDATA[<p>I figured it out with help from others <a href="http://forums.mysql.com/read.php?21,375635,375939#msg-375939" rel="nofollow">http://forums.mysql.com/read.php?21,375635,375939#msg-375939</a></p>
<p>It is because myisam_sort_buffer_size was not set properly. Apparently, there is one more thing you need to take into consideration when Repairing a MyISAM.</p>
<p>Thanks,</p>
<p>Bing</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Venu Anuganti</title>
		<link>http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/comment-page-1/#comment-10368</link>
		<dc:creator>Venu Anuganti</dc:creator>
		<pubDate>Fri, 16 Jul 2010 07:19:25 +0000</pubDate>
		<guid isPermaLink="false">http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/#comment-10368</guid>
		<description>Bing

Unless you give an example; it is hard. Contact me at http://venublog.com/contact/</description>
		<content:encoded><![CDATA[<p>Bing</p>
<p>Unless you give an example; it is hard. Contact me at <a href="http://venublog.com/contact/" rel="nofollow">http://venublog.com/contact/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bing</title>
		<link>http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/comment-page-1/#comment-10352</link>
		<dc:creator>Bing</dc:creator>
		<pubDate>Fri, 09 Jul 2010 22:26:26 +0000</pubDate>
		<guid isPermaLink="false">http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/#comment-10352</guid>
		<description>Venu

This is good piece of work. However, even after checking everything you mentioned, I still get &quot;repair by keycache&quot; occasionally. When I say &quot;occasionally&quot;, I mean that it works most of the time (&quot;repair by sorting&quot;), yet every once in a while, it still falls into &quot;repair by keycache&quot; without reason. When that does happen, the myisam_max_sort_file_size shows plenty of size (&quot;9223372036854775807&quot;), and the /tmp directory is not full.

What else am I missing?

Thanks,

Bing</description>
		<content:encoded><![CDATA[<p>Venu</p>
<p>This is good piece of work. However, even after checking everything you mentioned, I still get &#8220;repair by keycache&#8221; occasionally. When I say &#8220;occasionally&#8221;, I mean that it works most of the time (&#8220;repair by sorting&#8221;), yet every once in a while, it still falls into &#8220;repair by keycache&#8221; without reason. When that does happen, the myisam_max_sort_file_size shows plenty of size (&#8220;9223372036854775807&#8243;), and the /tmp directory is not full.</p>
<p>What else am I missing?</p>
<p>Thanks,</p>
<p>Bing</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Venu Anuganti</title>
		<link>http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/comment-page-1/#comment-9399</link>
		<dc:creator>Venu Anuganti</dc:creator>
		<pubDate>Tue, 05 Jan 2010 20:25:07 +0000</pubDate>
		<guid isPermaLink="false">http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/#comment-9399</guid>
		<description>Not really as you are not looking for the total index size here.. also; I never use Information_Schema.tables/columns as its very expensive especially when you have more tables in the server.</description>
		<content:encoded><![CDATA[<p>Not really as you are not looking for the total index size here.. also; I never use Information_Schema.tables/columns as its very expensive especially when you have more tables in the server.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mohammad Lahlouh</title>
		<link>http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/comment-page-1/#comment-9398</link>
		<dc:creator>Mohammad Lahlouh</dc:creator>
		<pubDate>Tue, 05 Jan 2010 08:22:32 +0000</pubDate>
		<guid isPermaLink="false">http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/#comment-9398</guid>
		<description>8) === &gt; 8 )</description>
		<content:encoded><![CDATA[<p> <img src='http://venublog.com/wp-includes/images/smilies/icon_cool.gif' alt='8)' class='wp-smiley' /> === &gt; 8 )</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mohammad Lahlouh</title>
		<link>http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/comment-page-1/#comment-9397</link>
		<dc:creator>Mohammad Lahlouh</dc:creator>
		<pubDate>Tue, 05 Jan 2010 08:21:27 +0000</pubDate>
		<guid isPermaLink="false">http://venublog.com/2010/01/04/performance-comparison-of-repair-by-sorting-or-by-keycache/#comment-9397</guid>
		<description>good article

in this formula (2000000 * (255 * 3) + 8) you want to know index size, is it right?
can we take the size from information_schema.index_length i think its easier when the table have multi index?</description>
		<content:encoded><![CDATA[<p>good article</p>
<p>in this formula (2000000 * (255 * 3) + <img src='http://venublog.com/wp-includes/images/smilies/icon_cool.gif' alt='8)' class='wp-smiley' /> you want to know index size, is it right?<br />
can we take the size from information_schema.index_length i think its easier when the table have multi index?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

