Search results for "dist:Tree-BPTree HANENKAMP"
Tree::BPTree - Perl implementation of B+ trees
B+ trees are balanced trees which provide an ordered map from keys to values. They are useful for indexing large bodies of data. They are similar to 2-3-4 Trees and Red-Black Trees. This implementation supports B+ trees using an arbitrary *n* value. ...
HANENKAMP/Tree-BPTree-1.08 - 23 Dec 2007 23:43:58 UTC