berenm / bplus-tree
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
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 2 months ago
- portability macros for compiler and hardware micro operations☆36Updated 9 months ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- A collection of SIMD optimized general purpose hash functions☆44Updated 10 years ago
- Static Radix Tree (Patricia trie) implementation in C☆49Updated 7 years ago
- Simple unoptimized AVL tree implementation in C89☆41Updated 4 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆45Updated 3 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- unrolled skip list library for C☆21Updated 5 years ago
- A just-in-time compiler for c minus☆47Updated 11 years ago
- lock free modified prefix B+tree append-only database☆117Updated 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 10 years ago
- Coroutines/Fibers implementation for x86☆65Updated 8 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- A lightweight coroutine library written in C and assembler☆39Updated 10 years ago
- Fast C/C++ memory allocator with free-all operation☆54Updated 9 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- A single producer single - single consumer queue implemented by a ring buffer with C11's 'stdatomic.h'☆37Updated last year
- Free-List Memory Pool of fixed-size objects in C99☆48Updated 2 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆140Updated 5 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Coroutine library in C.☆20Updated 4 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
- Concurrent trie-hash map library☆91Updated last year
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago