https://github.com/felixklauke/arya
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.
https://github.com/felixklauke/arya
accessibility binary-search-tree btree btree-indexes performance
Last synced: 3 days ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/felixklauke/arya
- Owner: felixklauke
- License: mit
- Created: 2018-03-12T09:46:28.000Z (over 7 years ago)
- Default Branch: dev
- Last Pushed: 2018-03-12T10:28:40.000Z (over 7 years ago)
- Last Synced: 2025-10-10T15:49:24.668Z (3 days ago)
- Topics: accessibility, binary-search-tree, btree, btree-indexes, performance
- Language: C++
- Homepage: http://felix-klauke.de
- Size: 17.6 KB
- Stars: 3
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README
# arya
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.