Alternatives and similar repositories for elf:

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

• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• InitialDLab / PBF
  Persistent Bloom Filter
  ☆12Updated 6 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆154Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• panagiotisl / chimp
  Chimp: Efficient Lossless Floating Point Compression for Time Series Databases
  ☆36Updated 8 months ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• ustcadsl / unikv
  ☆24Updated 2 years ago
• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆13Updated 2 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 4 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆148Updated 7 years ago
• splatlab / vqf
  A fast approximate membership query data structure
  ☆11Updated 8 months ago
• wuwuz / Vacuum-Filter
  ☆50Updated 4 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• baotonglu / dash
  Scalable Hashing on Persistent Memory
  ☆193Updated 11 months ago
• zingdle / SIGMOD2020-MonetDB-Bindex
  BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)
  ☆10Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆98Updated last year
• viktorleis / vmcache
  ☆63Updated last week
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆45Updated 10 months ago
• jiashenC / gpudb-char-and-opt
  ☆12Updated last year