Adaptive Radix Trees implemented in C
☆819Mar 21, 2022Updated 3 years ago
Alternatives and similar repositories for libart
Users that are interested in libart are comparing it to the libraries listed below
Sorting:
- An adaptive radix tree for efficient indexing in main memory.☆171Nov 24, 2025Updated 3 months ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- Persistent Adaptive Radix Trees in Java☆82Oct 5, 2020Updated 5 years ago
- ☆126Apr 8, 2022Updated 3 years ago
- Beta release of Masstree.☆457Oct 15, 2023Updated 2 years ago
- ☆150Mar 11, 2023Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80May 20, 2014Updated 11 years ago
- A radix tree implementation in ANSI C☆1,220Nov 26, 2023Updated 2 years ago
- QSBR and EBR library☆135Dec 15, 2019Updated 6 years ago
- qp tries and crit-bit tries☆124Jul 12, 2022Updated 3 years ago
- An open sourced implementation of Bw-Tree in SQL Server Hekaton☆526Nov 14, 2018Updated 7 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆85Apr 29, 2022Updated 3 years ago
- A high-performance, concurrent hash table☆1,733Mar 31, 2025Updated 11 months ago
- the fastest in-memory index in the East 东半球最快并发索引☆477Feb 4, 2021Updated 5 years ago
- WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems (FAST 2017)☆24Apr 1, 2021Updated 4 years ago
- C++ implementation of a fast and memory efficient HAT-trie☆859Nov 11, 2025Updated 3 months ago
- ☆15Feb 19, 2017Updated 9 years ago
- An open-source BzTree implementation☆92Aug 3, 2021Updated 4 years ago
- An efficient trie implementation.☆255Nov 25, 2020Updated 5 years ago
- Concurrency primitives, safe memory reclamation mechanisms and non-blocking (including lock-free) data structures designed to aid in the …☆2,607Updated this week
- Critbit trees in C☆333Dec 17, 2021Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- ☆1,008Nov 12, 2021Updated 4 years ago
- an adaptive radix tree implementation in go☆69Oct 11, 2021Updated 4 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Oct 15, 2024Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- 2019 Database System Project at Sun Yat-sen University , a simple implementation of SIGMOD, 2016 “FPTree: A Hybrid SCM-DRAM Persistent an…☆24Jul 14, 2019Updated 6 years ago
- First Practical and General-purpose Range Filter☆551Mar 11, 2022Updated 3 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Oct 4, 2021Updated 4 years ago
- A simple C library for compressing lists of integers using binary packing☆517Aug 18, 2023Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Sep 18, 2018Updated 7 years ago
- ☆30Nov 8, 2021Updated 4 years ago
- A Benchmark for Learned Indexes☆301Apr 27, 2022Updated 3 years ago
- Succinct Data Structure Library 2.0☆2,296Jun 2, 2023Updated 2 years ago
- Adaptive Radix Tree in Rust☆67Apr 28, 2018Updated 7 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,782Feb 20, 2026Updated last week
- Benchmarking framework for index structures on persistent memory☆89Jul 12, 2023Updated 2 years ago
- LSM-trie☆115Mar 22, 2021Updated 4 years ago
- User space threading (aka coroutines) library for C resembling GoLang and goroutines☆166Oct 3, 2018Updated 7 years ago