Alternatives and similar repositories for HortonHashing

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

• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆105Updated 7 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆139Updated 5 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• 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 7 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated last year
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆212Updated 9 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• opennvm / nvmkv
  NVM key-value store API lIbrary repository.
  ☆90Updated 11 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)
  ☆83Updated 3 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 8 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆32Updated 12 years ago
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• tellproject / tellstore
  A in-memory storage manager, that can do versioning and fast scans
  ☆50Updated 9 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆52Updated 8 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 7 years ago
• dsrhaslab / paio
  PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)
  ☆24Updated 2 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆450Updated 2 years ago
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 7 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• zhengqmark / indexfs-0.4
  New IndexFS core
  ☆26Updated 9 years ago