<?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: How to implement a queue in SQL</title>
	<atom:link href="http://www.xaprb.com/blog/2007/01/11/how-to-implement-a-queue-in-sql/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.xaprb.com/blog/2007/01/11/how-to-implement-a-queue-in-sql/</link>
	<description>Stay curious!</description>
	<lastBuildDate>Thu, 09 Feb 2012 09:56:43 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: Xaprb</title>
		<link>http://www.xaprb.com/blog/2007/01/11/how-to-implement-a-queue-in-sql/#comment-18452</link>
		<dc:creator>Xaprb</dc:creator>
		<pubDate>Tue, 29 Jun 2010 12:52:24 +0000</pubDate>
		<guid isPermaLink="false">http://www.xaprb.com/blog/?p=290#comment-18452</guid>
		<description>Glancing at it briefly, I think it&#039;ll suffer under high traffic.  But, I believe, so will my original post above -- I wrote this at a time when I didn&#039;t have that much experience with queues in MySQL.  Since then I&#039;ve seen that it is a hard problem that rarely scales well.</description>
		<content:encoded><![CDATA[<p>Glancing at it briefly, I think it&#8217;ll suffer under high traffic.  But, I believe, so will my original post above &#8212; I wrote this at a time when I didn&#8217;t have that much experience with queues in MySQL.  Since then I&#8217;ve seen that it is a hard problem that rarely scales well.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Thomas</title>
		<link>http://www.xaprb.com/blog/2007/01/11/how-to-implement-a-queue-in-sql/#comment-18447</link>
		<dc:creator>Thomas</dc:creator>
		<pubDate>Mon, 28 Jun 2010 13:52:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.xaprb.com/blog/?p=290#comment-18447</guid>
		<description>Interesting approaches, but most of them have the problem to lock the table on concurrent access. If one takes InnoDB as table type, the performance of MAX() falls by the wayside and using MyISAM would bring the aforementioned concurrency problem when reading and writing in parallel. I use a modified approach by Robert Eisele as a my queue logic, which outperforms the presented approaches: http://www.xarg.org/2009/09/fast-circular-buffer-in-mysql/

Thomas</description>
		<content:encoded><![CDATA[<p>Interesting approaches, but most of them have the problem to lock the table on concurrent access. If one takes InnoDB as table type, the performance of MAX() falls by the wayside and using MyISAM would bring the aforementioned concurrency problem when reading and writing in parallel. I use a modified approach by Robert Eisele as a my queue logic, which outperforms the presented approaches: <a href="http://www.xarg.org/2009/09/fast-circular-buffer-in-mysql/" rel="nofollow">http://www.xarg.org/2009/09/fast-circular-buffer-in-mysql/</a></p>
<p>Thomas</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rdb Notes &#183; How to implement a queue in SQL at Xaprb</title>
		<link>http://www.xaprb.com/blog/2007/01/11/how-to-implement-a-queue-in-sql/#comment-13353</link>
		<dc:creator>Rdb Notes &#183; How to implement a queue in SQL at Xaprb</dc:creator>
		<pubDate>Thu, 30 Aug 2007 15:03:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.xaprb.com/blog/?p=290#comment-13353</guid>
		<description>[...]  How to implement a queue in SQL at Xaprb  This article explains how to create a fixed-size FIFO (first-in, first-out) queue in SQL, where rows added after a threshold will cause the oldest row to be deleted. There are several ways to do this, but MERGE on Oracle and DB2, and MySQLâ€™s non-standard extensions to SQL, make an elegant solution easy. [...]</description>
		<content:encoded><![CDATA[<p>[...]  How to implement a queue in SQL at Xaprb  This article explains how to create a fixed-size FIFO (first-in, first-out) queue in SQL, where rows added after a threshold will cause the oldest row to be deleted. There are several ways to do this, but MERGE on Oracle and DB2, and MySQLâ€™s non-standard extensions to SQL, make an elegant solution easy. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anish</title>
		<link>http://www.xaprb.com/blog/2007/01/11/how-to-implement-a-queue-in-sql/#comment-12506</link>
		<dc:creator>Anish</dc:creator>
		<pubDate>Tue, 24 Jul 2007 06:23:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.xaprb.com/blog/?p=290#comment-12506</guid>
		<description>Great article! How do I ensure unique value in fruit column, say no other rows should have &#039;peaches&#039; if it is already in queue</description>
		<content:encoded><![CDATA[<p>Great article! How do I ensure unique value in fruit column, say no other rows should have &#8216;peaches&#8217; if it is already in queue</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Xaprb</title>
		<link>http://www.xaprb.com/blog/2007/01/11/how-to-implement-a-queue-in-sql/#comment-5410</link>
		<dc:creator>Xaprb</dc:creator>
		<pubDate>Fri, 30 Mar 2007 13:19:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.xaprb.com/blog/?p=290#comment-5410</guid>
		<description>&lt;p&gt;It might work to use a calculation like &lt;code&gt;TO_DAYS(CURRENT_DATE) % 60&lt;/code&gt;, or some variation thereof.&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>It might work to use a calculation like <code>TO_DAYS(CURRENT_DATE) % 60</code>, or some variation thereof.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

