armon / libartLinks
Adaptive Radix Trees implemented in C
☆815Updated 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.☆450Updated 2 years ago
- A simple and small bloom filter implementation in plain C.☆302Updated 3 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆1,165Updated 2 years ago
- A working project for High-concurrency B-tree source code in C☆252Updated 5 years ago
- The PebblesDB write-optimized key-value store (SOSP 17)☆522Updated last year
- A simple C library for compressing lists of integers using binary packing☆515Updated 2 years ago
- A Super Fast Multithreaded malloc() for 64-bit Machines☆293Updated 6 years ago
- Multicore in-memory storage engine☆398Updated 8 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Updated 8 years ago
- Fast on-disk persistent key-value store☆388Updated 7 years ago
- LSM-trie☆114Updated 4 years ago
- C port of the HdrHistogram☆268Updated 4 months ago
- PerconaFT is a high-performance, transactional key-value store☆561Updated last year
- A benchmark to compare synchronization techniques for multicore programming☆348Updated 6 months ago
- A benchmark framework for concurrent queue implementations☆296Updated 5 years ago
- Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes☆479Updated 5 years ago
- Read- and latency-optimized log structured merge tree☆175Updated 13 years ago
- Roaring bitmaps in C (and C++), with SIMD (AVX2, AVX-512 and NEON) optimizations: used by Apache Doris, ClickHouse, Alibaba Tair, Redpand…☆1,752Updated last week
- QSBR and EBR library☆135Updated 6 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆441Updated 6 months ago
- How to use the Linux AIO feature☆340Updated 2 years ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated last month
- Fastest Integer Compression☆822Updated last year
- Key/Value Datastore for Persistent Memory☆404Updated 2 years ago
- Fastest RPC in the west☆754Updated 2 years ago
- A radix tree implementation in ANSI C☆1,207Updated 2 years ago
- Unmaintained C implementation of the Raft consensus protocol☆953Updated last year
- Fast Static Symbol Table (FSST): efficient random-access string compression☆489Updated last month