armon / libartLinks
Adaptive Radix Trees implemented in C
☆795Updated 3 years ago
Alternatives and similar repositories for libart
Users that are interested in libart are comparing it to the libraries listed below
Sorting:
- Beta release of Masstree.☆442Updated last year
- Multicore in-memory storage engine☆389Updated 7 years ago
- A simple C library for compressing lists of integers using binary packing☆499Updated last year
- A radix tree implementation in ANSI C☆1,165Updated last year
- A Super Fast Multithreaded malloc() for 64-bit Machines☆290Updated 5 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆1,147Updated 2 years ago
- Fast integer compression in C using the StreamVByte codec☆402Updated 4 months ago
- Critbit trees in C☆336Updated 3 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆434Updated last year
- The FastPFOR C++ library: Fast integer compression☆923Updated 3 months ago
- A working project for High-concurrency B-tree source code in C☆250Updated 4 years ago
- A benchmark framework for concurrent queue implementations☆291Updated 5 years ago
- A simple and small bloom filter implementation in plain C.☆299Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- The PebblesDB write-optimized key-value store (SOSP 17)☆515Updated last year
- Concurrency primitives, safe memory reclamation mechanisms and non-blocking (including lock-free) data structures designed to aid in the …☆2,506Updated last week
- An open sourced implementation of Bw-Tree in SQL Server Hekaton☆512Updated 6 years ago
- Key/Value Datastore for Persistent Memory☆400Updated 2 years ago
- Unmaintained C implementation of the Raft consensus protocol☆949Updated last year
- [deprecated] For native C atomics, see Turf instead☆518Updated 8 years ago
- Fastest RPC in the west☆734Updated 2 years ago
- C library implementing the ridiculously fast CLHash hashing function☆278Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆160Updated 3 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
- An efficient trie implementation.☆255Updated 4 years ago
- PerconaFT is a high-performance, transactional key-value store☆562Updated last year
- Fastest Integer Compression☆808Updated last year
- Header-only binary fuse and xor filter library☆369Updated 4 months ago
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- ☆146Updated 2 years ago