Since no one else has asked I will: What does your data look like?

That is,

• how long are the keys?
• how long are the associated records?

A couple of typical examples would be good. Configuring the page size and cache size parameters to suit your data can have a strong influence upon performance.

Also, how are you going to access (search) the records? That is, will your accesses be:

• Totally random;
• Initially random followed by sequential;
• Always sequential;
• Other

Selecting the 'right' access method--btree, hash, queue, recno--to achieve best performance depends a lot upon how you access the data. Without knowledge of how your application will operate, advise is at best, generic.