FIFO queue (or stack) implemented on disk, not ram (preferably in C++) [closed]

Question

Basically what I'm after is the equivalent of the Standard Template Library queue implemented in such a way as to use the disk for storage. The volume of data that will need to be in the queue is far greater than can be stored in the ram of most computers today.

Ideally, I'm after a library to use. However, any recommendation on how to implement this queue would be useful.

Answer 1

You might want to look at the STXXL:

"The core of STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, i.e., STXXL implements containers and algorithms that can process huge volumes of data that only fit on disks."

Answer 2

You might want to look into the STLXX library. It contains a disk-based priority queue using the "Sequence Heap" model described by Peter Sanders.

Answer 3

A wild idea: Implement an allocator class that reads/writes to and from a file on disk and pass it to STL deque or queue or whatever suits your needs.