Are there any fast b-tree implementations for Perl other than the one in the Tree.tar.gz package? That one is complete, I guess, but it's in pure Perl, and I'm going for speed. I also looked into BerkeleyDB, but it's a heavy install, and it's not a very perlish interface (for iteration over key ranges, not unique lookups).

I don't need a particular implementation, e.g. AVL or Red/Black. However, the faster, the better.