armon / libartLinks
Adaptive Radix Trees implemented in C
☆802Updated 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.☆445Updated last year
- A Super Fast Multithreaded malloc() for 64-bit Machines☆292Updated 5 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆1,154Updated 2 years ago
- Multicore in-memory storage engine☆394Updated 7 years ago
- A simple C library for compressing lists of integers using binary packing☆506Updated 2 years ago
- Share Hash Tables With Stable Key Hints Stored In Memory Mapped Files Between Arbitrary Processes☆475Updated 4 years ago
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- Fast on-disk persistent key-value store☆387Updated 7 years ago
- The PebblesDB write-optimized key-value store (SOSP 17)☆519Updated last year
- A simple and small bloom filter implementation in plain C.☆302Updated 3 years ago
- A benchmark framework for concurrent queue implementations☆293Updated 5 years ago
- LSM-trie☆114Updated 4 years ago
- A radix tree implementation in ANSI C☆1,189Updated last year
- QSBR and EBR library☆127Updated 5 years ago
- Critbit trees in C☆335Updated 3 years ago
- Murmur3 hash in C☆429Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- C port of the HdrHistogram☆253Updated last month
- Roaring bitmaps in C (and C++), with SIMD (AVX2, AVX-512 and NEON) optimizations: used by Apache Doris, ClickHouse, Alibaba Tair, Redpand…☆1,692Updated last week
- The FastPFOR C++ library: Fast integer compression☆932Updated 3 months ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- PerconaFT is a high-performance, transactional key-value store☆561Updated last year
- Fast integer compression in C using the StreamVByte codec☆408Updated 7 months ago
- How to use the Linux AIO feature☆336Updated 2 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆165Updated last year
- Fastest Integer Compression☆811Updated last year
- A benchmark to compare synchronization techniques for multicore programming☆346Updated 3 months ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 5 years ago