0
I Use This!
Activity Not Available
Analyzed over 6 years ago. based on code collected over 6 years ago.

Project Summary

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.

Tags

No tags have been added

In a Nutshell, Tree::BPTree...

Artistic License 2.0
Permitted
Forbidden
Required

These details are provided for information only. No information here is legal advice and should not be used as such.

GNU General Public License v2.0 or later
Permitted

Place Warranty

Commercial Use

Modify

Distribute

Forbidden

Sub-License

Hold Liable

Required

Distribute Original

Disclose Source

Include Copyright

State Changes

Include License

These details are provided for information only. No information here is legal advice and should not be used as such.

All Licenses

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    compare projects before you chose one to use
  • ...
    use of OSS increased in 65% of companies in 2016
  • ...
    data presented on the Open Hub is available through our API

30 Day Summary

Sep 19 2011 — Oct 19 2011

12 Month Summary

not available

Ratings

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!