Clean and fast binary search tree ('B-Tree') implementation suitable for usage in fast on disk storage engines for providing fast and as direct as possible access on items.
-
Notifications
You must be signed in to change notification settings - Fork 0
Clean and fast binary search tree ('B-Tree') implementation suitable for usage in fast on disk storage engines for providing fast and as direct as possible access on items.
License
felixklauke/arya
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Clean and fast binary search tree ('B-Tree') implementation suitable for usage in fast on disk storage engines for providing fast and as direct as possible access on items.
Topics
Resources
License
Code of conduct
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published