berenm / bplus-treeLinks
Fast in-memory B+-Tree implementation in C.
☆29Updated 9 years ago
Alternatives and similar repositories for bplus-tree
Users that are interested in bplus-tree are comparing it to the libraries listed below
Sorting:
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆49Updated 3 years ago
- Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."☆19Updated 14 years ago
- userspace threads and coroutines for C☆18Updated 9 years ago
- Coroutines/Fibers implementation for x86☆65Updated 8 years ago
- Simple unoptimized AVL tree implementation in C89☆41Updated 4 years ago
- For details, see the blog post:☆32Updated last year
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 3 weeks ago
- The world's first Web-scale memory allocator☆107Updated 6 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- portability macros for compiler and hardware micro operations☆36Updated 11 months ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Volatile Persistent Memory Allocator☆25Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Static Radix Tree (Patricia trie) implementation in C☆50Updated 8 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- unrolled skip list library for C☆21Updated 6 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 10 years ago
- iomux - High performance aynchronous I/O multiplexing and timers☆15Updated 9 years ago
- A compact library for C99 (and MSVC in C++ mode) providing refcounted arrays, maps, lists and a cool lexical scanner.☆42Updated 8 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆140Updated 5 years ago
- A single producer single - single consumer queue implemented by a ring buffer with C11's 'stdatomic.h'☆37Updated last year