<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>The Developer Day &#187; sorting</title>
	<atom:link href="http://www.thedeveloperday.com/tag/sorting/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.thedeveloperday.com</link>
	<description>Staying Curious</description>
	<lastBuildDate>Fri, 03 Feb 2012 12:03:22 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>MySQL &#8211; ORDER BY RAND() optimization</title>
		<link>http://www.thedeveloperday.com/mysql-order-by-rand-optimization/</link>
		<comments>http://www.thedeveloperday.com/mysql-order-by-rand-optimization/#comments</comments>
		<pubDate>Thu, 08 Jan 2009 11:44:46 +0000</pubDate>
		<dc:creator>Žilvinas Šaltys</dc:creator>
				<category><![CDATA[Lazyweb]]></category>
		<category><![CDATA[MySQL]]></category>
		<category><![CDATA[Optimization]]></category>
		<category><![CDATA[randomization]]></category>
		<category><![CDATA[sorting]]></category>

		<guid isPermaLink="false">http://www.thedeveloperday.com/mysql-order-by-rand-optimization/</guid>
		<description><![CDATA[Interesting read about order by rand optimization by Jan Kneschke. Haven&#8217;t used this myself but seems might be rather useful. The performance difference is huge. I wonder if MySQL could optimize ORDER BY RAND() itself when there are no data holes.]]></description>
			<content:encoded><![CDATA[<p>Interesting read about <a href="http://jan.kneschke.de/projects/mysql/order-by-rand/" title="mysql order by RAND() optimization">order by rand optimization</a> by <a href="http://jan.kneschke.de/" title="jan kneschke">Jan Kneschke</a>. Haven&#8217;t used this myself but seems might be rather useful. The performance difference is huge. I wonder if MySQL could optimize ORDER BY RAND() itself when there are no data holes.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.thedeveloperday.com/mysql-order-by-rand-optimization/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MySQL Top N Sort Algorithm</title>
		<link>http://www.thedeveloperday.com/mysql-top-n-sort-algorithm/</link>
		<comments>http://www.thedeveloperday.com/mysql-top-n-sort-algorithm/#comments</comments>
		<pubDate>Fri, 12 Dec 2008 16:29:46 +0000</pubDate>
		<dc:creator>Žilvinas Šaltys</dc:creator>
				<category><![CDATA[Lazyweb]]></category>
		<category><![CDATA[MySQL]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[sorting]]></category>

		<guid isPermaLink="false">http://www.thedeveloperday.com/mysql-top-n-sort-algorithm/</guid>
		<description><![CDATA[While reading planetmysql I&#8217;ve found a very interesting article about Top N Sort algorithm. It would be nice to have this implemented in MySQL. There are millions of applications that have sorted and paginated lists of data. Some of those lists are really big. For example company that I work for has a web application [...]]]></description>
			<content:encoded><![CDATA[<p>While reading <a href="http://www.planetmysql.org">planetmysql</a> I&#8217;ve found a very interesting article about <a href="http://labs.cybozu.co.jp/blog/kazuhoatwork/2008/12/using_top_n_sort_on_mysql.php" title="MySQL Top N Sort">Top N Sort algorithm</a>. It would be nice to have this implemented in MySQL. There are millions of applications that have sorted and paginated lists of data. Some of those lists are really big. For example company that I work for has a web application with a report that has milions of rows and it has to be sorted and it only shows a few hundred rows in a single page. This would definitely be a great improvement to MySQL.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.thedeveloperday.com/mysql-top-n-sort-algorithm/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MySQL character sets and collations</title>
		<link>http://www.thedeveloperday.com/mysql-character-sets-and-collations/</link>
		<comments>http://www.thedeveloperday.com/mysql-character-sets-and-collations/#comments</comments>
		<pubDate>Mon, 08 Dec 2008 15:05:39 +0000</pubDate>
		<dc:creator>Žilvinas Šaltys</dc:creator>
				<category><![CDATA[MySQL]]></category>
		<category><![CDATA[Optimization]]></category>
		<category><![CDATA[PHP]]></category>
		<category><![CDATA[character-sets]]></category>
		<category><![CDATA[collations]]></category>
		<category><![CDATA[sorting]]></category>

		<guid isPermaLink="false">http://www.thedeveloperday.com/mysql-character-sets-and-collations/</guid>
		<description><![CDATA[Another great article I&#8217;ve found about MySQL character sets and collations that demystifies all the so often found problems in projects made by confused developers. This also can help you to save some space your database takes and improve your queries performance because more of your database can fit into memory.]]></description>
			<content:encoded><![CDATA[<p>Another great article I&#8217;ve found about <a title="MySQL character sets and collations" href="http://code.openark.org/blog/?p=10">MySQL character sets and collations</a> that demystifies all the so often found problems in projects made by confused developers. This also can help you to save some space your database takes and improve your queries performance because more of your database can fit into memory.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.thedeveloperday.com/mysql-character-sets-and-collations/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

