<?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: Database Questions for 2010: What&#8217;s On My Mind</title>
	<atom:link href="http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/feed/" rel="self" type="application/rss+xml" />
	<link>http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/</link>
	<description>Computer Scientist and Open Scholar: Databases, Information Retrieval, Business Intelligence.</description>
	<lastBuildDate>Thu, 24 May 2012 04:42:46 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
	<item>
		<title>By: Kevembuangga</title>
		<link>http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/comment-page-1/#comment-52071</link>
		<dc:creator>Kevembuangga</dc:creator>
		<pubDate>Wed, 06 Jan 2010 00:17:35 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/?p=2359#comment-52071</guid>
		<description>&lt;i&gt;I had to fix this once myself.&lt;/i&gt;

OK, fix that C one:

for (i = size - 1; i;) {
&#160; &#160; for (j = i; ++j &lt; size &amp;&amp; a[j-1] &gt; a[j]; swap(a[j-1], a[j]));
&#160; &#160; while (--i &amp;&amp; a{i] &lt;= a[i+1]);
}
:-)
</description>
		<content:encoded><![CDATA[<p><i>I had to fix this once myself.</i></p>
<p>OK, fix that C one:</p>
<p>for (i = size &#8211; 1; i;) {<br />
&nbsp; &nbsp; for (j = i; ++j &lt; size &amp;&amp; a[j-1] &gt; a[j]; swap(a[j-1], a[j]));<br />
&nbsp; &nbsp; while (&#8211;i &amp;&amp; a{i] &lt;= a[i+1]);<br />
}<br />
 <img src='http://lemire.me/blog/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Daniel Lemire</title>
		<link>http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/comment-page-1/#comment-52068</link>
		<dc:creator>Daniel Lemire</dc:creator>
		<pubDate>Tue, 05 Jan 2010 13:24:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/?p=2359#comment-52068</guid>
		<description>@Bannister

Yes, you are quite right. By lightweight, I mean that it reduces the computational cost.</description>
		<content:encoded><![CDATA[<p>@Bannister</p>
<p>Yes, you are quite right. By lightweight, I mean that it reduces the computational cost.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Preston L. Bannister</title>
		<link>http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/comment-page-1/#comment-52067</link>
		<dc:creator>Preston L. Bannister</dc:creator>
		<pubDate>Tue, 05 Jan 2010 06:39:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/?p=2359#comment-52067</guid>
		<description>More exactly, by &quot;lightweight&quot; you mean &quot;compute-cost-effective&quot; compression. Can compression save CPU cycles? Maybe. Sometimes. Would be good to explore and map that dimension somewhat.</description>
		<content:encoded><![CDATA[<p>More exactly, by &#8220;lightweight&#8221; you mean &#8220;compute-cost-effective&#8221; compression. Can compression save CPU cycles? Maybe. Sometimes. Would be good to explore and map that dimension somewhat.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Itman</title>
		<link>http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/comment-page-1/#comment-52066</link>
		<dc:creator>Itman</dc:creator>
		<pubDate>Tue, 05 Jan 2010 06:20:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/?p=2359#comment-52066</guid>
		<description>Chances are huge! I had to fix this once myself. The premature optimization problem arises usually, when there are two comparable algorithms and you chose a more complicated. Then, of course, it is a waste of time. But to chose the right algorithm, you should first understand the problem. That requires some CS knowledge. Moreover, Moore&#039;s law would not hold forever. Sooner or later you have to optimize to get this 10 or 50 percent increase. In some applications such as large-scale applications (e.g. web search), you have to do this already.</description>
		<content:encoded><![CDATA[<p>Chances are huge! I had to fix this once myself. The premature optimization problem arises usually, when there are two comparable algorithms and you chose a more complicated. Then, of course, it is a waste of time. But to chose the right algorithm, you should first understand the problem. That requires some CS knowledge. Moreover, Moore&#8217;s law would not hold forever. Sooner or later you have to optimize to get this 10 or 50 percent increase. In some applications such as large-scale applications (e.g. web search), you have to do this already.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kevembuangga</title>
		<link>http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/comment-page-1/#comment-52065</link>
		<dc:creator>Kevembuangga</dc:creator>
		<pubDate>Tue, 05 Jan 2010 06:06:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/?p=2359#comment-52065</guid>
		<description>&lt;i&gt;Unfortunately, quite often their code contains such horrible jokes as bubble sort. Which, in turn, other folks have to debug and to fix.&lt;/i&gt;

&lt;b&gt;Debugging&lt;/b&gt; bubble sort?
What are the chances that a bug show up in bubble sort relative to any other sort?
It&#039;s ugly and horrendously inefficient but if you have a dozen items to sort it could be that it &lt;b&gt;IS&lt;/b&gt; the right solution.
You didn&#039;t really grok the points in the linked comment, did you?</description>
		<content:encoded><![CDATA[<p><i>Unfortunately, quite often their code contains such horrible jokes as bubble sort. Which, in turn, other folks have to debug and to fix.</i></p>
<p><b>Debugging</b> bubble sort?<br />
What are the chances that a bug show up in bubble sort relative to any other sort?<br />
It&#8217;s ugly and horrendously inefficient but if you have a dozen items to sort it could be that it <b>IS</b> the right solution.<br />
You didn&#8217;t really grok the points in the linked comment, did you?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Itman</title>
		<link>http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/comment-page-1/#comment-52064</link>
		<dc:creator>Itman</dc:creator>
		<pubDate>Mon, 04 Jan 2010 21:44:40 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/?p=2359#comment-52064</guid>
		<description>I just love these arrogant people who think that CS education and academia are  useless. Of course, only they -- real warriors -- save the world and write the code. Unfortunately, quite often their code contains such horrible jokes as bubble sort. Which, in turn, other folks have to debug and to fix.</description>
		<content:encoded><![CDATA[<p>I just love these arrogant people who think that CS education and academia are  useless. Of course, only they &#8212; real warriors &#8212; save the world and write the code. Unfortunately, quite often their code contains such horrible jokes as bubble sort. Which, in turn, other folks have to debug and to fix.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Daniel Lemire</title>
		<link>http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/comment-page-1/#comment-52063</link>
		<dc:creator>Daniel Lemire</dc:creator>
		<pubDate>Mon, 04 Jan 2010 18:54:22 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/?p=2359#comment-52063</guid>
		<description>@Kevembuangga

Good points. 

You may enjoy this blog post by Maarten van Emden on &quot;What is Computer Science?&quot;

http://vanemden.wordpress.com/2009/12/27/what-is-computer-science/</description>
		<content:encoded><![CDATA[<p>@Kevembuangga</p>
<p>Good points. </p>
<p>You may enjoy this blog post by Maarten van Emden on &#8220;What is Computer Science?&#8221;</p>
<p><a href="http://vanemden.wordpress.com/2009/12/27/what-is-computer-science/" rel="nofollow">http://vanemden.wordpress.com/2009/12/27/what-is-computer-science/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Kevembuangga</title>
		<link>http://lemire.me/blog/archives/2010/01/04/database-questions-for-2010-what%e2%80%99s-on-my-mind/comment-page-1/#comment-52062</link>
		<dc:creator>Kevembuangga</dc:creator>
		<pubDate>Mon, 04 Jan 2010 18:24:11 +0000</pubDate>
		<guid isPermaLink="false">http://www.daniel-lemire.com/blog/?p=2359#comment-52062</guid>
		<description>Don&#039;t bother!
There are &lt;a href=&quot;http://rjlipton.wordpress.com/2009/12/19/the-3-percent-solution/#comment-2214&quot; rel=&quot;nofollow&quot;&gt;cheaper ways&lt;/a&gt; to improve software performance ;-)
CS research is mostly another form of &quot;mathematical disease&quot;.
Oh! Happy New Year nevertheless...</description>
		<content:encoded><![CDATA[<p>Don&#8217;t bother!<br />
There are <a href="http://rjlipton.wordpress.com/2009/12/19/the-3-percent-solution/#comment-2214" rel="nofollow">cheaper ways</a> to improve software performance <img src='http://lemire.me/blog/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /><br />
CS research is mostly another form of &#8220;mathematical disease&#8221;.<br />
Oh! Happy New Year nevertheless&#8230;</p>
]]></content:encoded>
	</item>
</channel>
</rss>

