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: 27 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 (almost 7 years ago)
• Default Branch: dev
• Last Pushed: 2018-03-12T10:28:40.000Z (almost 7 years ago)
• Last Synced: 2024-11-08T18:53:20.387Z (3 months ago)
• Topics: accessibility, binary-search-tree, btree, btree-indexes, performance
• Language: C++
• Homepage: http://felix-klauke.de
• Size: 17.6 KB
• Stars: 3
• Watchers: 5
• 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.