http://ayende.comAyende @ RahienCopyright (C) Ayende Rahien 2004 - 2021 (c) 202660You're a one-man API factory. Amazing. http://ayende.com/3479/rhino-queues-storage-disk#comment9http://ayende.com/3479/rhino-queues-storage-disk#comment9Mon, 04 Aug 2008 08:19:29 GMT@Frans, you're watching your competitors very goed.. ;-) http://ayende.com/3479/rhino-queues-storage-disk#comment8http://ayende.com/3479/rhino-queues-storage-disk#comment8Sat, 02 Aug 2008 17:10:43 GMT@Marco: isn't x-tensive doing that already for the past, what... 3 years? Every time they're re-re-re-re-re-rewriting what they have to capture even more things in the universe. http://ayende.com/3479/rhino-queues-storage-disk#comment7http://ayende.com/3479/rhino-queues-storage-disk#comment7Sat, 02 Aug 2008 09:00:34 GMTYou should contact Alex from x-tensive.com.. They are also building a DB Storage without a DB, see http://blog.x-tensive.com/2008/02/still-no-ctp.html and other blogposts.. http://ayende.com/3479/rhino-queues-storage-disk#comment6http://ayende.com/3479/rhino-queues-storage-disk#comment6Fri, 01 Aug 2008 20:38:55 GMTYes, you would. Several named queues: new PersistentQueue("QueuesDir", "foo") new PersistentQueue("QueuesDir", "bar") Each would have their own sub directory in the main one http://ayende.com/3479/rhino-queues-storage-disk#comment5http://ayende.com/3479/rhino-queues-storage-disk#comment5Fri, 01 Aug 2008 20:37:40 GMTSo if you wanted to have several queues in a single process, I presume you would create several PersistentQueue objects (one per queue) each with a different path? Any way to have "named" queues that can share a path? http://ayende.com/3479/rhino-queues-storage-disk#comment4http://ayende.com/3479/rhino-queues-storage-disk#comment4Fri, 01 Aug 2008 20:26:20 GMTExcellent! I can't wait to put this thing to work. http://ayende.com/3479/rhino-queues-storage-disk#comment3http://ayende.com/3479/rhino-queues-storage-disk#comment3Fri, 01 Aug 2008 19:32:15 GMTJustin, I used a queue of (comb) guids as well as a btree keyed by the guids together. That allowed fast access and still let me have variable length data. As for threading issues, there is a bug in BDB 4.5, which is the only version that has a .NET API. I wasn't going to write my own. http://ayende.com/3479/rhino-queues-storage-disk#comment2http://ayende.com/3479/rhino-queues-storage-disk#comment2Fri, 01 Aug 2008 19:31:43 GMTCool stuff. Question - in your BDB experiments why did you use a BTree instead of their Queue table storage? Just curious. I've used it with great success from C++ and Java having 100's of threads access it. From their docs... "Data is stored in a queue as fixed-length records. Each record uses a logical record number as its key. This access method is designed for fast inserts at the tail of the queue, and it has a special operation that deletes and returns a record from the head of the queue. This access method is unusual in that it provides record level locking. This can provide beneficial performance improvements in applications requiring concurrent access to the queue." http://ayende.com/3479/rhino-queues-storage-disk#comment1http://ayende.com/3479/rhino-queues-storage-disk#comment1Fri, 01 Aug 2008 19:26:33 GMT