Alternatives and similar repositories for cache-oblivious-btree:

Users that are interested in cache-oblivious-btree are comparing it to the libraries listed below

• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆39Updated 2 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆273Updated last month
• cmuparlay / flock
  Library for lock-free locks
  ☆76Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆152Updated 10 months ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆18Updated 5 years ago
• mars-research / DRAMHiT
  ☆28Updated this week
• lemire / testingmlp
  Testing memory-level parallelism
  ☆67Updated 10 months ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• google / hashtable-benchmarks
  ☆104Updated last year
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆103Updated 4 months ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆41Updated this week
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆40Updated last month
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆55Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 7 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• rahulyesantharao / b-epsilon-tree
  A simple implementation of the write-optimized Bε Tree 🌳 - for MIT 6.854 (Advanced Algorithms).
  ☆24Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆172Updated 4 years ago