vedantk / quotient-filter

Related projects ⓘ

Alternatives and complementary repositories for quotient-filter

• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆125Updated last year
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 3 years ago
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆133Updated 2 years ago
• lemire / dictionary
  High-performance dictionary coding
  ☆103Updated 7 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆263Updated 10 months ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆49Updated 6 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆27Updated 3 years ago
• efficient / memc3
  MemC3
  ☆150Updated 7 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆139Updated 6 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 3 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 2 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆40Updated 7 years ago
• lemire / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆117Updated 5 months ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆176Updated 6 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆61Updated 5 months ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆52Updated 10 months ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆46Updated 5 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆32Updated last year
• hideo55 / cpp-HyperLogLog
  C++ implementation of HyperLogLog
  ☆57Updated 5 months ago
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆73Updated 3 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆148Updated 3 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆97Updated 6 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆150Updated 7 months ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆246Updated last year
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆39Updated last month