success 11724 Tree::BPTree 2008-02-14T20:55:53Z 2008-10-18T12:04:18Z 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. This is a Perl implementation of this data structure. http://search.cpan.org/dist/Tree-BPTree/ http://search.cpan.org/dist/Tree-BPTree/ Tree-BPTree 0 0 295514 295514 11724 2009-12-01T22:02:48Z 2009-12-01T22:02:44Z 2007-12-01T00:00:00Z 2007-12-01T00:00:00Z 1 1761 8 Perl Artistic License 2_0 Artistic License 2.0 gpl GNU General Public License 2.0