Alternatives and similar repositories for vqf

Users that are interested in vqf are comparing it to the libraries listed below

• wuwuz / Vacuum-Filter
  ☆52Updated 10 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆55Updated last year
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆103Updated 2 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated 2 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 7 months ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆21Updated 5 months ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• arif-arman / origami-sort
  Implementation of Origami: A High-Performance Mergesort Framework
  ☆27Updated 10 months ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆48Updated 3 months ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆165Updated last year
• viktorleis / vmcache
  ☆72Updated 3 weeks ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆123Updated 11 months ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• microsoft / pmwcas
  pmwcas
  ☆138Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• tuhhosg / exmap
  ☆48Updated last year
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆87Updated 4 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆125Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• zingdle / SIGMOD2020-MonetDB-Bindex
  BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)
  ☆10Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 5 years ago