<?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: The depth of an index: primer</title>
	<atom:link href="http://code.openark.org/blog/mysql/the-depth-of-an-index-primer/feed" rel="self" type="application/rss+xml" />
	<link>http://code.openark.org/blog/mysql/the-depth-of-an-index-primer</link>
	<description>Blog by Shlomi Noach</description>
	<lastBuildDate>Wed, 01 Feb 2012 20:47:51 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Reducing locks by narrowing primary key &#124; code.openark.org</title>
		<link>http://code.openark.org/blog/mysql/the-depth-of-an-index-primer/comment-page-1#comment-13065</link>
		<dc:creator>Reducing locks by narrowing primary key &#124; code.openark.org</dc:creator>
		<pubDate>Tue, 04 May 2010 06:46:06 +0000</pubDate>
		<guid isPermaLink="false">http://code.openark.org/blog/?p=545#comment-13065</guid>
		<description>[...] the fact that a bloated PRIMARY KEY bloats the entire clustered index and secondary keys (see: The depth of an index: primer), it is also a source for locks. It&#8217;s true that any UNIQUE KEY can serve as a PRIMARY KEY. [...]</description>
		<content:encoded><![CDATA[<p>[...] the fact that a bloated PRIMARY KEY bloats the entire clustered index and secondary keys (see: The depth of an index: primer), it is also a source for locks. It&#8217;s true that any UNIQUE KEY can serve as a PRIMARY KEY. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: The Depth of a B-tree&#160;&#124;&#160;Tokutek</title>
		<link>http://code.openark.org/blog/mysql/the-depth-of-an-index-primer/comment-page-1#comment-6334</link>
		<dc:creator>The Depth of a B-tree&#160;&#124;&#160;Tokutek</dc:creator>
		<pubDate>Mon, 09 Nov 2009 15:37:36 +0000</pubDate>
		<guid isPermaLink="false">http://code.openark.org/blog/?p=545#comment-6334</guid>
		<description>[...] Noach recently wrote a useful primer on the depth of B-trees and how that plays out for point queries &#8212; in both clustered indexes, like InnoDB, and in [...]</description>
		<content:encoded><![CDATA[<p>[...] Noach recently wrote a useful primer on the depth of B-trees and how that plays out for point queries &#8212; in both clustered indexes, like InnoDB, and in [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

