splatlab / vqf

Related projects ⓘ

Alternatives and complementary repositories for vqf

• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 6 months ago
• wuwuz / Vacuum-Filter
  ☆50Updated 5 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆140Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆96Updated last year
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• njulands / HashAdaptiveBF
  ☆15Updated 3 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• pdet / ProgressiveIndexing
  Stand-alone implementation of the progressive indexing algorithms.
  ☆16Updated 4 years ago
• tuhhosg / exmap
  ☆37Updated 7 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 3 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)
  ☆76Updated 2 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆23Updated 9 months ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆22Updated 4 years ago
• caetanosauer / fineline-zero
  ☆12Updated 5 years ago
• huanchenz / index-microbench
  ☆15Updated 7 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆41Updated last year
• 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
• InitialDLab / PBF
  Persistent Bloom Filter
  ☆11Updated 6 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆150Updated 8 months ago
• flode / ARTSynchronized
  ☆115Updated 2 years ago
• baotonglu / apex
  High Performance Learned Index on Persistent Memory
  ☆46Updated last year
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• junhe / wiser
  A fast text search engine built for SSDs, written in C++.
  ☆12Updated 2 years ago
• gre4index / GRE
  GRE is a benchmark suite to compare learned indexes and traditional indexes.
  ☆45Updated 2 years ago
• Pfzuo / Path-Hashing
  A Write-friendly and Cache-optimized Hashing Scheme for Non-volatile Memory Systems (MSST 2017, TPDS 2018)
  ☆29Updated 6 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.
  ☆149Updated 3 years ago