What dbtype of Berkeley db should I use for my task ? And some more questions
===

I have many fixed size data to be stored like an array on disk. Because the size is fixed, so the access time of every record should be equal in theory, (by calculating the offset and jump to it).

Instead of implementing my own little library, I'm looking in to Berkeley DB and I'm in confuse of QUEUE and RECNO. 

1. For example, QUEUE, according to the document, it's designed to append and get data from the top fast, does it mean that if I use it for random access, it will be slow ? And the "put" method is weird, because it takes "key" and "value", instead of just value to append the data structure. 

2. And I tried to use a random string on the key instead of integer, and it works. (It shouldn't work because it's not BTREE or HASH). I wonder, in order to use QUEUE efficiently, how should it supposed to be used.

3. In RECNO, there is non-fixed length mode, which means that, the random access is probably not going to be good ?

I guess if I use Berkeley DB for storing my array, I should use QUEUE/RECNO with fixed-length mode, but I'm not sure how to use it so that the random access is fast.