Alternatives and similar repositories for tree-encoded-bitmaps

Users that are interested in tree-encoded-bitmaps are comparing it to the libraries listed below

• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆82Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆55Updated last year
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆26Updated last year
• viktorleis / vmcache
  ☆72Updated 3 weeks ago
• tuhhosg / exmap
  ☆48Updated last year
• efficient / HOPE
  Order-preserving key encoder
  ☆125Updated 5 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆165Updated last year
• viktorleis / perfevent
  An easy-to-use, header-only C++ wrapper for Linux' perf event API
  ☆128Updated 6 months ago
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆107Updated last month
• L-v-M / async
  ☆20Updated 2 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆250Updated 3 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 10 months ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆91Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• wangziqi2016 / index-microbench
  ☆149Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆52Updated last year
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆65Updated 3 weeks ago
• wuwuz / Vacuum-Filter
  ☆52Updated 10 months ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated last month
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago