I am planning to release my version of a btree written in Ruby sometime 
next week.  It will allow you to store terabytes of data across multiple 
files and should allow you to quickly retrieve that data.  I have the code 
written and tested.  I just need to revise my test scripts and complete the 
documentation.

-----Original Message-----
From:	Joe Graham [SMTP:joe / aiobjects.com]
Sent:	Saturday, July 21, 2001 5:15 PM
To:	ruby-talk ML
Subject:	[ruby-talk:18272] Effecient indexing algorithm

Hello,
Does anyone have an efficient indexing algorithm or care to point me in the
right direction.  I am looking to index several terabytes of data across
mutiple files.  The file format does not matter so much as the ability to
keep a low memory footprint based on the size of the index and for any 
given
query the index must be efficiently sorted.

I have looked at dbm and dbm seems to keep a stack of keys which as we know
can be a bit of an inconvenience when it comes to searching.  Hopefully I 
am
wrong here.  Any thoughts or comments would be appreciated.

-joe graham