<?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: Introducing Multiple Clustering Indexes</title>
	<atom:link href="http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/feed/" rel="self" type="application/rss+xml" />
	<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/</link>
	<description>Database Performance</description>
	<lastBuildDate>Sat, 28 Aug 2010 12:16:29 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: Clustering indexes vs. Covering indexes&#160;&#124;&#160;Tokutek</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-1603</link>
		<dc:creator>Clustering indexes vs. Covering indexes&#160;&#124;&#160;Tokutek</dc:creator>
		<pubDate>Thu, 19 Aug 2010 19:45:42 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-1603</guid>
		<description>[...] I (Zardosht) posted an entry introducing clustering indexes. Here, I elaborate on three differences between a clustering index and a covering [...]</description>
		<content:encoded><![CDATA[<p>[...] I (Zardosht) posted an entry introducing clustering indexes. Here, I elaborate on three differences between a clustering index and a covering [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: How clustering indexes sometimes help UPDATE and DELETE performance&#160;&#124;&#160;Tokutek</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-1601</link>
		<dc:creator>How clustering indexes sometimes help UPDATE and DELETE performance&#160;&#124;&#160;Tokutek</dc:creator>
		<pubDate>Thu, 19 Aug 2010 19:43:13 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-1601</guid>
		<description>[...] recently posted a blog entry on clustering indexes, which are good for speeding up queries. Eric Day brought up the concern that clustering indexes [...]</description>
		<content:encoded><![CDATA[<p>[...] recently posted a blog entry on clustering indexes, which are good for speeding up queries. Eric Day brought up the concern that clustering indexes [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: MySQL 5.1 Grammar Changes to Support Clustering Indexes&#160;&#124;&#160;Tokutek</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-1600</link>
		<dc:creator>MySQL 5.1 Grammar Changes to Support Clustering Indexes&#160;&#124;&#160;Tokutek</dc:creator>
		<pubDate>Thu, 19 Aug 2010 19:42:12 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-1600</guid>
		<description>[...] blogging about TokuDB&#8217;s multiple clustering indexes feature, Baron Schwartz suggested we contribute the patch to allow other storage engine to [...]</description>
		<content:encoded><![CDATA[<p>[...] blogging about TokuDB&#8217;s multiple clustering indexes feature, Baron Schwartz suggested we contribute the patch to allow other storage engine to [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Improving TPC-H-like queries &#8211; Q17&#160;&#124;&#160;Tokutek</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-1599</link>
		<dc:creator>Improving TPC-H-like queries &#8211; Q17&#160;&#124;&#160;Tokutek</dc:creator>
		<pubDate>Thu, 19 Aug 2010 19:41:11 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-1599</guid>
		<description>[...] Summary: A query like TPC-H Query 17 can be sped up by large factors by using straight_joins and clustering indexes. (This entry posted by [...]</description>
		<content:encoded><![CDATA[<p>[...] Summary: A query like TPC-H Query 17 can be sped up by large factors by using straight_joins and clustering indexes. (This entry posted by [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark Callaghan</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-622</link>
		<dc:creator>Mark Callaghan</dc:creator>
		<pubDate>Mon, 15 Mar 2010 21:19:49 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-622</guid>
		<description>This is very nice. I missed this post when you first wrote it. It can be used to provide much better bounds on worst-case query performance (a few disk reads versus thousands) and do a much better job at making queries &#039;online&#039;.</description>
		<content:encoded><![CDATA[<p>This is very nice. I missed this post when you first wrote it. It can be used to provide much better bounds on worst-case query performance (a few disk reads versus thousands) and do a much better job at making queries &#8216;online&#8217;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kristian Nielsen</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-173</link>
		<dc:creator>Kristian Nielsen</dc:creator>
		<pubDate>Fri, 29 May 2009 03:07:22 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-173</guid>
		<description>Ah, now I think I see the difference between this and normal covering indexes. The difference here is that the extra fields are only stored in the leaf nodes (assuming Btree index). The keys in interior nodes need not store the extra fields, unlike in traditional covering indexes where the extra fields needlessly increase the key size proper.

That might be useful, especially when the row size is much bigger than the key size (not at all uncommon).</description>
		<content:encoded><![CDATA[<p>Ah, now I think I see the difference between this and normal covering indexes. The difference here is that the extra fields are only stored in the leaf nodes (assuming Btree index). The keys in interior nodes need not store the extra fields, unlike in traditional covering indexes where the extra fields needlessly increase the key size proper.</p>
<p>That might be useful, especially when the row size is much bigger than the key size (not at all uncommon).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Zardosht Kasheff</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-172</link>
		<dc:creator>Zardosht Kasheff</dc:creator>
		<pubDate>Thu, 28 May 2009 23:59:45 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-172</guid>
		<description>@Venu, with TokuDB, we typically measure compression ratios of 3x to 12x relative to the amount of raw data in a table.  Since a clustering index is another copy of the table in a different sort order, it will probably consume somewhere between 1/3 and 1/12 of the table&#039;s raw data size.</description>
		<content:encoded><![CDATA[<p>@Venu, with TokuDB, we typically measure compression ratios of 3x to 12x relative to the amount of raw data in a table.  Since a clustering index is another copy of the table in a different sort order, it will probably consume somewhere between 1/3 and 1/12 of the table&#8217;s raw data size.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Venu Kalyan</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-171</link>
		<dc:creator>Venu Kalyan</dc:creator>
		<pubDate>Thu, 28 May 2009 21:34:59 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-171</guid>
		<description>Can you describe how much extra storage is needed for each add-on clustered index/table ?</description>
		<content:encoded><![CDATA[<p>Can you describe how much extra storage is needed for each add-on clustered index/table ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Zardosht Kasheff</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-170</link>
		<dc:creator>Zardosht Kasheff</dc:creator>
		<pubDate>Thu, 28 May 2009 20:53:26 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-170</guid>
		<description>@Kristian, good questions. I will address covering indexes vs. clustering indexes in a blog post later today.</description>
		<content:encoded><![CDATA[<p>@Kristian, good questions. I will address covering indexes vs. clustering indexes in a blog post later today.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kristian Nielsen</title>
		<link>http://tokutek.com/2009/05/introducing_multiple_clustering_indexes/comment-page-1/#comment-169</link>
		<dc:creator>Kristian Nielsen</dc:creator>
		<pubDate>Thu, 28 May 2009 04:38:15 +0000</pubDate>
		<guid isPermaLink="false">http://introducing_multiple_clustering_indexes#comment-169</guid>
		<description>How is this any different from a covering index in MyISAM (or InnoDB) obtained by just appending all remaining columns after the indexed keys?

Especially with the restriction on no unique indexes, that seems to be exactly the same?

From the description it sounds like this is just a syntax shortcut for creating covering indexes, which are supported in MyISAM and InnoDB (but not Falcon). But a covering index is not a clustered index, since as Eric writes it does not improve insert/update speed in any scenarios.</description>
		<content:encoded><![CDATA[<p>How is this any different from a covering index in MyISAM (or InnoDB) obtained by just appending all remaining columns after the indexed keys?</p>
<p>Especially with the restriction on no unique indexes, that seems to be exactly the same?</p>
<p>From the description it sounds like this is just a syntax shortcut for creating covering indexes, which are supported in MyISAM and InnoDB (but not Falcon). But a covering index is not a clustered index, since as Eric writes it does not improve insert/update speed in any scenarios.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
