agl / critbit
Critbit trees in C
☆333Updated 3 years ago
Alternatives and similar repositories for critbit:
Users that are interested in critbit are comparing it to the libraries listed below
- qp tries and crit-bit tries☆119Updated 2 years ago
- An efficient trie implementation.☆254Updated 4 years ago
- C port of the HdrHistogram☆241Updated 4 months ago
- A Super Fast Multithreaded malloc() for 64-bit Machines☆288Updated 5 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 2 years ago
- User space threading (aka coroutines) library for C resembling GoLang and goroutines☆165Updated 6 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 3 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆140Updated 5 years ago
- QSBR and EBR library☆118Updated 5 years ago
- C library implementing the ridiculously fast CLHash hashing function☆273Updated 11 months ago
- High performance utility library for C☆92Updated 7 months ago
- A benchmark framework for concurrent queue implementations☆289Updated 4 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- STM (Software Transactional Memory) implementation in C, based on memory-mapping.☆59Updated 15 years ago
- timer.c: Tickless hierarchical timing wheel☆225Updated last year
- C multiplatform coroutine implementation via ucontext, fibers or setjmp☆263Updated 15 years ago
- An obsolete project☆83Updated 6 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆94Updated 5 years ago
- Adaptive Radix Trees implemented in C☆784Updated 2 years ago
- Tracking, Benchmarking and Sharing Information about an open source embedded data storage engines, internals, architectures, data storage…☆181Updated 6 years ago
- A very fast scalar implementation for Frame Of Reference integer compression.☆108Updated 9 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆274Updated 3 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆156Updated 2 months ago
- An-source C library developed and used at AppNexus.☆108Updated 5 years ago
- Concurrent trie-hash map library☆91Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- lock free modified prefix B+tree append-only database☆117Updated 9 years ago
- Embedded storage benchmarking tool☆138Updated 2 years ago
- LSM-trie☆113Updated 3 years ago