in reply to fast B*-Tree implementation

There's Btrees, and the one in this MJD article, but if you care about speed you should be using BerkeleyDB.