Menu
does anyone know of a good database based Priority Queue implementation?
I'm dealing with large amounts of data so keeping it all in memory is unfeasible.
Thanks!
440
Priority Queue is an abstract data type that is similar to a queue, and every element has some priority value associated with it. The priority of the elements in a priority queue determines the order in which elements are served (i.e., the order in which they are removed).
There are two types of priority queues based on the priority of elements. If the element with the smallest value has the highest priority, then that priority queue is called the min priority queue. If the element with a higher value has the highest priority, then that priority queue is known as the max priority queue.
The binary heap is the most efficient method for implementing the priority queue in the data structure.
Priority Queue is an Abstract Data Type (ADT) that holds a collection of elements, it is similar to a normal Queue, the difference is that the elements will be dequeued following a priority order.
Maybe you want a Message Queue?
There are several good ones, both proprietary and open source. For a simple API, check memcacheq, for a more complete, high-performace, take a look at RabbitMQ
143
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
