if you need a strictly FIFO queue, what I'm about to offer does not satisfy FIFO. I created a "mostly" FIFO queue for processing work items that could arrive out of order, didn't matter for my use case.
https://github.com/btoddb/cassandra-queue/wiki/Queue-Design maintaining FIFO order using Cassandra runs into bottlenecks because of what tatu says below, tombstones build up on a row and will dramatically slow down the processing. read the wiki page above, but I don't support it and I don't answer questions anymore as it has been too long ago and I'm too busy, sorry. but you may learn something from it and that's why I keep it out there :) good luck, cheers On 1/18/12 9:26 AM, "Tatu Saloranta" <tsalora...@gmail.com> wrote: >On Wed, Jan 18, 2012 at 7:31 AM, Eric Martell <workoutexc...@yahoo.com> >wrote: >> Hi, >> >> I am having 10 millions of rows with in sql db in key table. >> >> key_id -> key_value >> >> >> For each request I am fetching one key_id and removing that >> from the key table. Each request should get unique key_id. Similar to >> java queue but keys persists in DB. >> >> How do I implement that in Cassandra and what is the best way to >>achieve this? > >Why Cassandra and not a real queue implementation? >My first advice would usually be just "don't", since deletion is done >by tombstoning. >What may work better is store payload in Cassandra and send ids >separately; this is how we did a queueing system with AWS (SQS for >passing ids, S3 for storing payload) > >-+ Tatu +-
