Alternatives and similar repositories for HortonHashing

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

• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆106Updated 7 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated last year
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆182Updated 8 years ago
• dsrhaslab / paio
  PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)
  ☆24Updated 2 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• apache / incubator-retired-quickstep
  Apache Quickstep Incubator - This project is retired
  ☆94Updated 7 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 years ago
• opennvm / nvmkv
  NVM key-value store API lIbrary repository.
  ☆90Updated 11 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆52Updated 8 years ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 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)
  ☆84Updated 3 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last year
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆38Updated 6 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆160Updated 8 years ago
• WukLab / Hotpot
  Distributed Shared Persistent Memory. SoCC 2017
  ☆69Updated 5 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆39Updated 5 years ago