RedisLabs / triemapLinks
C implementation of a compressed trie lookup map
☆23Updated 6 years ago
Alternatives and similar repositories for triemap
Users that are interested in triemap are comparing it to the libraries listed below
Sorting:
- Concurrent trie-hash map library☆92Updated 2 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆52Updated 3 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- Static Radix Tree (Patricia trie) implementation in C☆48Updated 8 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 7 months ago
- Lock-free slab allocator / freelist.☆69Updated 10 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆47Updated 12 years ago
- User space threading (aka coroutines) library for C resembling GoLang and goroutines☆166Updated 7 years ago
- lock-free LIFO stack by C native built it, easy built cross platform(no extra dependencies needed) , guarantee thread safety memory manag…☆32Updated 7 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- ☆27Updated 8 years ago
- iomux - High performance aynchronous I/O multiplexing and timers☆16Updated 2 weeks ago
- Embedded DB Benchmark Framework☆62Updated 4 years ago
- Fast C/C++ memory allocator with free-all operation☆55Updated 10 years ago
- Latency benchmarks of Unix IPC mechanisms☆100Updated last month
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Updated 11 years ago
- Embedded storage benchmarking tool☆139Updated 3 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆139Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- C based ordered key-value ACID DB using a skip list data structure☆163Updated 10 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- Cross-platform atomic operations and lock algorithm library☆99Updated 7 years ago
- A C11 implementation of D. Vyukov MPSC queue☆32Updated 2 years ago
- For details, see the blog post:☆34Updated last year
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- ☆11Updated 7 years ago