Alternatives and similar repositories for Vacuum-Filter

Users that are interested in Vacuum-Filter are comparing it to the libraries listed below

• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 years ago
• tuhhosg / exmap
  ☆50Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆56Updated last year
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆50Updated 6 months ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated last month
• viktorleis / vmcache
  ☆80Updated 4 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• efficient / HOPE
  Order-preserving key encoder
  ☆127Updated 5 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 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)
  ☆83Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 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…
  ☆125Updated last year
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆37Updated 2 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆112Updated last year
• microsoft / FishStore
  FishStore is a prototype fast ingestion and querying layer for flexible-schema data
  ☆232Updated 2 years ago
• AutomataLab / Pison
  Scalable Structural Index Constructor for JSON Analytics
  ☆26Updated last year
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆73Updated 4 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆121Updated 9 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago