jvirkki / libbloomLinks
A simple and small bloom filter implementation in plain C.
☆302Updated 3 years ago
Alternatives and similar repositories for libbloom
Users that are interested in libbloom are comparing it to the libraries listed below
Sorting:
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- Adaptive Radix Trees implemented in C☆809Updated 3 years ago
- QSBR and EBR library☆133Updated 5 years ago
- timer.c: Tickless hierarchical timing wheel☆233Updated 2 years ago
- Critbit trees in C☆334Updated 3 years ago
- An efficient trie implementation.☆255Updated 5 years ago
- Murmur3 hash in C☆434Updated 3 years ago
- Bloom filters for C++11☆365Updated 3 years ago
- lock free modified prefix B+tree append-only database☆116Updated 10 years ago
- Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes☆478Updated 4 years ago
- A distributed durable unique 64bit ID server☆206Updated 7 years ago
- redis's async event loop library☆189Updated 6 years ago
- A C library of hashtables and tries designed to store objects with high performance☆241Updated last month
- Russ Cox's libtask (with enhancements)☆321Updated 13 years ago
- A Super Fast Multithreaded malloc() for 64-bit Machines☆293Updated 6 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆139Updated 6 years ago
- Cross-platform atomic operations and lock algorithm library☆100Updated 7 years ago
- A C library implementation of a Cuckoo Filter☆26Updated 4 years ago
- Our open source benchmarks and code samples☆193Updated last month
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- (Keep It) Simple Stupid Database☆365Updated 10 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆181Updated 7 years ago
- A benchmark framework for concurrent queue implementations☆294Updated 5 years ago
- STL like container of radix tree (a.k.a. PATRICIA trie) in C++☆142Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- C multiplatform coroutine implementation via ucontext, fibers or setjmp☆265Updated 16 years ago
- How to use the Linux AIO feature☆339Updated 2 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago