> You should account for this in your design by either managing your own de-dupe solution (such as using Memcache to hold the keys you've seen from a given queue, expiring with the visibility timeout on the queue) or design a system which self-defends against duplicate messages.<p>At that point, why not just use beanstalkd or redis? You're already centralizing part of your queue elsewhere, and the point of Riak is decentralization.<p>However, if you <i>can</i> tolerate duplicate messages, then this seems like a cool system. I didn't get from the README how it actually orders the jobs/messages though. I get it uses an index range scan, but on what values? Is it an ID, and how does the client generate these?