UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays

Related projects ⓘ

Alternatives and complementary repositories for Efficiently-Searching-In-Memory-Sorted-Arrays

• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 6 months ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 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
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆32Updated last year
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆56Updated 7 years ago
• L-v-M / async
  ☆21Updated last year
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆22Updated 4 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
• caetanosauer / fineline-zero
  ☆12Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 5 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 2 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆37Updated this week
• lemire / dictionary
  High-performance dictionary coding
  ☆103Updated 7 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆98Updated 8 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• flode / ARTSynchronized
  ☆115Updated 2 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆140Updated 6 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 7 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆40Updated 2 weeks ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 8 years ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• tuhhosg / exmap
  ☆37Updated 7 months ago
• wuwuz / Vacuum-Filter
  ☆50Updated 5 years ago
• flippingbits / cssl
  Cache-Sensitive Skip List.
  ☆22Updated 6 years ago