Hi all-- I'm looking for some advice on pros/cons/designs for implementing a queue in ODB. The queue stores messages in a more-or-less FIFO manner based on the individual message priority (an integer), with the possibility that some messages may need to be retried over a period of time, but ultimately all messages that are put into the queue will come out. In SQL, this was fairly easily accomplished with a secondary index on the timestamp and priority of the message row, so that a query to get the top message (i.e. the best one to process and remove from the queue) based on these parameters is fast and efficient (made more so by adding a READPAST hint that will allow multiple threads to work on the queue at the same time without blocking each other). I suppose in ODB, I could essentially replicate this design, but I'm wondering if there's a better design paradigm. --Eric
-- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
