☆39Jun 20, 2020Updated 5 years ago
Alternatives and similar repositories for tree-encoded-bitmaps
Users that are interested in tree-encoded-bitmaps are comparing it to the libraries listed below
Sorting:
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Dec 2, 2021Updated 4 years ago
- A read-optimized learned index for unsorted data☆32Aug 10, 2023Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 6 months ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆28Feb 2, 2024Updated 2 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Jun 13, 2020Updated 5 years ago
- ☆16Jan 24, 2025Updated last year
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆16Jul 5, 2023Updated 2 years ago
- Low level algorithms for persistent memory.☆16Feb 9, 2021Updated 5 years ago
- simd enabled column imprints☆11Feb 12, 2018Updated 8 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
- Library for lock-free locks☆84Jun 26, 2023Updated 2 years ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆127Oct 10, 2024Updated last year
- A simple implementation of the write-optimized Bε Tree 🌳 - for MIT 6.854 (Advanced Algorithms).☆26Dec 27, 2019Updated 6 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Jun 7, 2023Updated 2 years ago
- A Benchmark for Learned Indexes☆301Apr 27, 2022Updated 3 years ago
- Compact, non-backtracking, unicode aware regular expressions in C89☆10Apr 17, 2025Updated 10 months ago
- Context-free grammar parsing library☆10Oct 6, 2024Updated last year
- FNV hash collision generator☆12Mar 2, 2017Updated 9 years ago
- a simple and human readable binary diff format and implementation☆20Feb 8, 2024Updated 2 years ago
- Some zig libraries☆14Sep 5, 2023Updated 2 years ago
- An implementation of a lexically scoped, referentially transparent, minimal Lisp with some added features☆10Mar 30, 2022Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 8 months ago
- C++ header only multi-paxos library.☆41Mar 30, 2022Updated 3 years ago
- Code and workloads from the Learned Cardinalities paper (https://arxiv.org/abs/1809.00677)☆127May 6, 2019Updated 6 years ago
- Adaptive Radix Tree in C++☆51Feb 25, 2026Updated last week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- Source code of our implementation of the concurrent RMA☆12May 23, 2019Updated 6 years ago
- ☆12Dec 14, 2019Updated 6 years ago
- ☆12May 29, 2024Updated last year
- SkinnerDB is an analytical database management system. It uses adaptive processing and reinforcement learning to find near-optimal join o…☆53Mar 3, 2024Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- 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