Adaptive Radix Tree in C++
☆51Feb 25, 2026Updated last week
Alternatives and similar repositories for unodb
Users that are interested in unodb are comparing it to the libraries listed below
Sorting:
- std::map/std::set implementation using the adaptive radix tree☆15Jul 14, 2021Updated 4 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Mar 17, 2025Updated 11 months ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 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
- Embedded InnoDB based on v5.1☆35Oct 1, 2025Updated 5 months ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Mar 30, 2023Updated 2 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆18Aug 9, 2018Updated 7 years ago
- Postgres connectivity for modern C++☆10May 19, 2020Updated 5 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Jun 7, 2023Updated 2 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- A Study of Database Performance Sensitivity to Experiment Settings☆10May 31, 2022Updated 3 years ago
- ☆12Jun 25, 2021Updated 4 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆11Feb 7, 2026Updated 3 weeks ago
- C++ header only multi-paxos library.☆41Mar 30, 2022Updated 3 years ago
- The Adaptive Radix Tree for Rust☆17Jan 18, 2025Updated last year
- TSXor: A Simple Time Series Compression Algorithm☆53Feb 19, 2025Updated last year
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 6 months ago
- Source code of our implementation of the concurrent RMA☆12May 23, 2019Updated 6 years ago
- ☆14Apr 1, 2023Updated 2 years ago
- ☆12Dec 18, 2018Updated 7 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆164Mar 25, 2019Updated 6 years ago
- Tunnel is a Pipeline Execution Engine based on C++20 coroutine☆30Aug 17, 2023Updated 2 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 3 years ago
- A convenient LRU cache server that supports REST API and Let's Encrypt.☆18May 24, 2018Updated 7 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- Reducing the cache misses of SIMD vectorization using IMV☆29Jun 29, 2022Updated 3 years ago
- ☆126Apr 8, 2022Updated 3 years ago
- Package tcp provides the boilerpale code for working with TCP based data. The package allows you to establish a TCP listener that can acc…☆15Aug 15, 2019Updated 6 years ago
- continuously update cloud database papers☆83May 22, 2024Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆172Nov 24, 2025Updated 3 months ago
- Fast Cardinality Estimation of Multi-Join Queries Using Sketches☆16Feb 29, 2024Updated 2 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Jun 13, 2020Updated 5 years ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆16Jul 5, 2023Updated 2 years ago
- ☆16Mar 16, 2021Updated 4 years ago
- ☆16Jan 24, 2025Updated last year
- Research project on scaling GPU-accelerated data management to large data volumes. Code base of two SIGMOD papers.☆17Jun 14, 2022Updated 3 years ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- A new cardinality estimation scheme for join query estimation☆42Dec 6, 2024Updated last year