All values are kept in leaf nodes, with internal nodes continaing only keys.
Currently if the degree is < 20 a simple linear search is used to locate key placement within a nodes keys. If the degree is > 20, binary search is used.
-
Notifications
You must be signed in to change notification settings - Fork 0
jhenzie/bplustree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Simple bplustree implementation
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published