Alternatives and similar repositories for elf

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

• naivewong / timeunion
  ☆12Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆55Updated last year
• panagiotisl / chimp
  Chimp: Efficient Lossless Floating Point Compression for Time Series Databases
  ☆40Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆32Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆157Updated 7 years ago
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆47Updated 6 months ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 6 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated last year
• wheatman / BP-Tree
  ☆15Updated 10 months ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• viktorleis / vmcache
  ☆78Updated 3 months ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆27Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated 3 weeks ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆12Updated last year
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆23Updated 8 months ago
• wuwuz / Vacuum-Filter
  ☆53Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 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.
  ☆165Updated 4 years ago