Alternatives and similar repositories for partitioned-filters

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

• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• snu-dbxlab / vWeaver
  ☆8Updated 4 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 4 years ago
• wheatman / BP-Tree
  ☆13Updated 4 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 5 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated last year
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• Henning1 / dogqc
  A query compiler for GPUs that translates relational algebra to Cuda.
  ☆21Updated last year
• tum-db / user-defined-operators
  Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"
  ☆23Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• tum-db / cachecoherence
  ☆12Updated 3 years ago
• zingdle / SIGMOD2020-MonetDB-Bindex
  BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)
  ☆10Updated 5 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 6 months ago
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated 5 months ago
• zxjcarrot / libdbos
  Source code for Practical DB-OS Co-Design with Privileged Kernel Bypass
  ☆11Updated 4 months ago
• eBay / IOManager
  IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage
  ☆10Updated 2 weeks ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 2 months ago
• umbra-db / colibri-vldb2024
  Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"
  ☆21Updated 10 months ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆55Updated last month
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 5 years ago
• danyangz / lightning
  Lightning In-Memory Object Store
  ☆46Updated 3 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.
  ☆13Updated 2 years ago
• viktorleis / vmcache
  ☆70Updated 2 months ago