berenm / bplus-tree
Fast in-memory B+-Tree implementation in C.
☆27Updated 9 years ago
Related projects ⓘ
Alternatives and complementary repositories for bplus-tree
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆35Updated this week
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆50Updated 8 months ago
- Lock-free allocator as described by Maged M. Michael, 2004☆43Updated 11 years ago
- W-TinyLFU cache C++11 header only implementation☆55Updated 6 years ago
- Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."☆19Updated 13 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆67Updated 10 years ago
- Benchmarks for our memory allocator☆61Updated last year
- Lock-free linked list☆16Updated 12 years ago
- A collection of SIMD optimized general purpose hash functions☆41Updated 9 years ago
- C++ Library of Atomic and Lockless Data Structures☆38Updated 4 years ago
- Concurrent trie-hash map library☆89Updated last year
- lock free modified prefix B+tree append-only database☆115Updated 9 years ago
- A C++ library for integer array compression☆27Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆55Updated 7 years ago
- C++ implementation of Concise and WAH compressed bitsets☆21Updated 7 years ago
- Simple RPC in C++, with Python binding☆27Updated 9 years ago
- Simple unoptimized AVL tree implementation in C89☆40Updated 4 years ago
- A single producer single - single consumer queue implemented by a ring buffer with C11's 'stdatomic.h'☆37Updated 11 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- C implementation of the Hazard-Pointers memory manager☆17Updated 10 years ago
- Coroutines/Fibers implementation for x86☆66Updated 8 years ago
- C++ implementation of concurrent Binary Search Trees☆73Updated 9 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆42Updated 9 years ago
- Lightweight append-only, header-less, journaling file format (C++11)☆12Updated 8 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 3 years ago
- Static Radix Tree (Patricia trie) implementation in C☆46Updated 7 years ago
- For details, see the blog post:☆31Updated 10 months ago