Alternatives and similar repositories for cuckoo-index

Users that are interested in cuckoo-index are comparing it to the libraries listed below

• efficient / HOPE
  Order-preserving key encoder
  ☆123Updated 5 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆104Updated 9 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆279Updated 6 months ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆154Updated 7 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• UWQuickstep / quickstep
  Quickstep project
  ☆42Updated 8 months ago
• viktorleis / mmapbench
  ☆137Updated 3 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆233Updated 3 weeks ago
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆123Updated 9 months ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 8 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆49Updated last year
• apache / datasketches-cpp
  Core C++ Sketch Library
  ☆234Updated 3 weeks ago
• wuwuz / Vacuum-Filter
  ☆51Updated 7 months ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆46Updated 2 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)
  ☆80Updated 3 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.
  ☆163Updated 3 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆48Updated 2 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆106Updated 10 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• Thesys-lab / Segcache
  ☆121Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• microsoft / FishStore
  FishStore is a prototype fast ingestion and querying layer for flexible-schema data
  ☆225Updated last year
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last month
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago