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.
Commercial Use
Modify
Distribute
Sub-License
Private Use
Hold Liable
Use Trademarks
Include Copyright
State Changes
Include Install Instructions
Rename
These details are provided for information only. No information here is legal advice and should not be used as such.
Commercial Use
Modify
Distribute
Place Warranty
Sub-License
Hold Liable
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.