Does anyone have a b-tree class for Ruby?  I need a class that will allow 
me to find one record in a million as quickly as possible and with as few 
disk I/Os as possible.

Thanks, Michael