Alternatives and similar repositories for partitioned-filters

Users that are interested in partitioned-filters are comparing it to the libraries listed below

• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• caetanosauer / fineline-zero
  ☆12Updated 7 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 years ago
• eBay / IOManager
  IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage
  ☆11Updated last month
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• wheatman / BP-Tree
  ☆16Updated 11 months ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 10 months ago
• L-v-M / async
  ☆20Updated 3 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• luyi0619 / star
  GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication
  ☆22Updated 6 years ago
• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆14Updated 2 years ago
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆24Updated last year
• UWHustle / HATtrick
  ☆36Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 4 years ago
• viktorleis / vmcache
  ☆81Updated 4 months ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated last year
• dsrhaslab / paio
  PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)
  ☆24Updated 2 years ago
• umbra-db / colibri-vldb2024
  Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"
  ☆25Updated last year
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆27Updated last year
• unodb-dev / unodb
  Adaptive Radix Tree in C++
  ☆50Updated this week