harald-lang / tree-encoded-bitmapsLinks
☆39Updated 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:
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆84Updated 3 years ago
- ☆57Updated last year
- ☆50Updated last year
- HOT - Height Optimized Trie☆158Updated 7 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- Quickstep project☆44Updated last year
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆28Updated last year
- ☆81Updated 4 months ago
- ☆20Updated 3 years ago
- ☆53Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- ☆125Updated 3 years ago
- Adaptive Radix Tree in C++☆50Updated last week
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Updated 7 months ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 3 years ago
- ☆30Updated 6 years ago
- Order-preserving key encoder☆127Updated 5 years ago
- Parallel Balanced Binary Tree Structures☆122Updated 10 months ago
- A Database System for Research and Fast Prototyping☆112Updated 2 months ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆55Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 9 months ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆137Updated 3 weeks 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…☆126Updated last year
- ☆12Updated 7 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆70Updated last month
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 5 months ago