anchorhash / cpp-anchorhash

Related projects ⓘ

Alternatives and complementary repositories for cpp-anchorhash

• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆95Updated 2 months ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆89Updated last year
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆38Updated 2 years ago
• tuhhosg / exmap
  ☆37Updated 7 months ago
• KioxiaAmerica / trocksdb
  RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance
  ☆54Updated 4 years ago
• uroni / fuseuring
  Using io_uring to implement a user space Linux fuse server
  ☆42Updated 3 years ago
• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆17Updated 2 months ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆71Updated last year
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆36Updated 5 months ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆41Updated last year
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆96Updated 3 months ago
• NetApp / zufs-zus
  zero-copy user-mode server. User-mode server which delegates zufs commands to specific file-system implementation.
  ☆50Updated 4 years ago
• hse-project / mpool
  mpool UAPI and CLI for HSE 1.x
  ☆35Updated 3 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
• NetApp / zufs-zuf
  zero-copy file-system feeder. A Linux module which dispatch kernel’s VFS commands to user-space server.
  ☆60Updated 4 years 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…
  ☆119Updated last month
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 6 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆27Updated 3 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆37Updated this week
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆96Updated last year
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆86Updated 3 years ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆148Updated 5 years ago
• aliireza / packetmill
  PacketMill: Toward per-core 100-Gbps Networking
  ☆62Updated 2 years ago
• compudj / librseq
  Library for Restartable Sequences
  ☆67Updated last month
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 7 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆58Updated 3 years ago