bplustree
B+Tree index
A minimal B+Tree indexing structure implementation for efficient key-value storage
A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage
2k stars
78 watching
314 forks
Language: C
last commit: over 3 years agoLinked from 1 awesome list
algorithmbplustreebtreecdata-structurestoragetreetree-structure
uhub/awesome-cRelated projects:
| Repository | Description | Stars |
|---|---|---|
 wyhaines/splay_tree_map.cr | A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items | 15 |
 bgamari/b-tree | An implementation of an immutable B-tree data structure optimized for disk storage and efficient querying. | 116 |
 attaswift/btree | A package that provides fast and efficient in-memory data structures using B-tree technology | 1,312 |
 django-treebeard/django-treebeard | Provides efficient tree data structures for Django web applications | 1,118 |
 braintree/braintree_ruby | A Ruby library providing access to the Braintree payment gateway | 446 |
 sbourlon/go-lctree | Provides data structures and utilities for serializing and deserializing LeetCode-style binary trees | 4 |
 sardariuss/motokostablebtree | A stable B-tree data structure implementation in Motoko for storing and retrieving key-value pairs. | 10 |
 viant/ptrie | A Go library implementing a fast and efficient prefix tree data structure for storing and retrieving key-value pairs in various formats. | 41 |
 bcrypt-ruby/bcrypt-ruby | A Ruby binding for the OpenBSD bcrypt() password hashing algorithm | 1,933 |
 canscale/stableheapbtreemap | A library implementing a functional BTree data structure | 5 |
 joelrorseth/tree-trouble | An interactive tutorial on Binary Search Trees designed for the Swift Playgrounds application on iPads | 24 |
 benedikt/mongoid-tree | A Mongoid document extension for building tree structures with a materialized path pattern | 302 |
 pathetiq/burpsmartbuster | A Burp Suite plugin that automatically adds smart discovery features to brute force attacks | 384 |
 jblindsay/kdtree | An efficient spatial data structure for fast point query operations | 43 |
 haskell/critbit | An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell | 138 |