<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: SQL Server 4</title>
	<atom:link href="http://jonathanlewis.wordpress.com/2010/06/28/sql-server-4/feed/" rel="self" type="application/rss+xml" />
	<link>http://jonathanlewis.wordpress.com/2010/06/28/sql-server-4/</link>
	<description>Just another Oracle weblog</description>
	<lastBuildDate>Thu, 23 May 2013 12:47:17 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Jonathan Lewis</title>
		<link>http://jonathanlewis.wordpress.com/2010/06/28/sql-server-4/#comment-36623</link>
		<dc:creator><![CDATA[Jonathan Lewis]]></dc:creator>
		<pubDate>Wed, 30 Jun 2010 09:00:23 +0000</pubDate>
		<guid isPermaLink="false">http://jonathanlewis.wordpress.com/?p=3991#comment-36623</guid>
		<description><![CDATA[Gary,

The locking issue is an interesting one. On an order processing system you&#039;re less likely to have two people entering an order for the same customer at the same time - so minimising overlaps between customers reduces a block-level lock problem. conversely if the data is simply being stored (as the heap would do) in order of arrival then you&#039;d be maximising block-level locking.  I&#039;ll have to mention that idea somewhere in the next couple of articles.

History does account for a lot of the strange beliefs in modern systems - but if you want to invoke history to explain the resistance to using index clustere you&#039;d have to have a much better argument than &quot;require a lot of planning&quot;.  (Technically it should require a lot of planning to pick the right clustered index in SQL Server - but I&#039;m not sure it happens.)]]></description>
		<content:encoded><![CDATA[<p>Gary,</p>
<p>The locking issue is an interesting one. On an order processing system you&#8217;re less likely to have two people entering an order for the same customer at the same time &#8211; so minimising overlaps between customers reduces a block-level lock problem. conversely if the data is simply being stored (as the heap would do) in order of arrival then you&#8217;d be maximising block-level locking.  I&#8217;ll have to mention that idea somewhere in the next couple of articles.</p>
<p>History does account for a lot of the strange beliefs in modern systems &#8211; but if you want to invoke history to explain the resistance to using index clustere you&#8217;d have to have a much better argument than &#8220;require a lot of planning&#8221;.  (Technically it should require a lot of planning to pick the right clustered index in SQL Server &#8211; but I&#8217;m not sure it happens.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Gary</title>
		<link>http://jonathanlewis.wordpress.com/2010/06/28/sql-server-4/#comment-36604</link>
		<dc:creator><![CDATA[Gary]]></dc:creator>
		<pubDate>Mon, 28 Jun 2010 22:47:36 +0000</pubDate>
		<guid isPermaLink="false">http://jonathanlewis.wordpress.com/?p=3991#comment-36604</guid>
		<description><![CDATA[I came to Oracle from using Ingres, which also had &#039;BTree&#039; structured tables as the preferred option. Looking back, I think one reason was the locking mechanism since, by clustering the records (eg for a customer), there was less impact when entire pages/blocks were locked.
I do remember that we had one monthly summary that did year-to-date figures, and it was quicker to re-organize the whole table with a different Btree key (and reorganise it back afterwards) than to do the maths with the &#039;wrong&#039; structure.

Still, I&#039;m sure SQL Server people would say Oracle dudes are married to heap structures because index-organized tables weren&#039;t supported in Oracle for so long, and even now have to be on the primary key. Clustered tables always seemed to require a lot of planning.]]></description>
		<content:encoded><![CDATA[<p>I came to Oracle from using Ingres, which also had &#8216;BTree&#8217; structured tables as the preferred option. Looking back, I think one reason was the locking mechanism since, by clustering the records (eg for a customer), there was less impact when entire pages/blocks were locked.<br />
I do remember that we had one monthly summary that did year-to-date figures, and it was quicker to re-organize the whole table with a different Btree key (and reorganise it back afterwards) than to do the maths with the &#8216;wrong&#8217; structure.</p>
<p>Still, I&#8217;m sure SQL Server people would say Oracle dudes are married to heap structures because index-organized tables weren&#8217;t supported in Oracle for so long, and even now have to be on the primary key. Clustered tables always seemed to require a lot of planning.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
