graydon / clepsydra

Related projects ⓘ

Alternatives and complementary repositories for clepsydra

• komora-io / ebr
  high-efficiency concurrent reclamation
  ☆35Updated 2 months ago
• knizhnik / yakv
  Yet another key-value storage for Rust
  ☆70Updated 2 years ago
• komora-io / pagetable
  wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata
  ☆36Updated 3 months ago
• komora-io / fault-injection
  trigger io::Error's in test, and annotate their source
  ☆30Updated last year
• Determinant / growth-ring
  Simple and modular write-ahead-logging implementation.
  ☆25Updated 9 months ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆68Updated last year
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆31Updated 2 years ago
• bnclabs / wral
  WRite Ahead Logging for distributed applications.
  ☆30Updated 2 years ago
• frankmcsherry / columnation
  An experimental columnar arena
  ☆41Updated 3 weeks ago
• spacejam / seaslug
  scraps of a potential language
  ☆37Updated 3 years ago
• spacejam / rsdb
  rust database engineering toolkit
  ☆35Updated 3 years ago
• khonsulabs / sediment
  A low-level MVCC file format for storing blobs.
  ☆63Updated 8 months ago
• tomaka / futures-diagnose
  Wraps around a futures::Spawn and adds diagnostics to it
  ☆31Updated 4 years ago
• komora-io / inline-array
  ☆10Updated last month
• jonhoo / indexmap-amortized
  bluss/IndexMap with amortized resizes
  ☆14Updated 3 years ago
• tipo159 / rust-instruction-dispatch
  This is a project to learn how to implement instruction dispatch in Rust.
  ☆17Updated 4 months ago
• sile / plumtree
  A Rust implementation of Plumtree algorithm
  ☆26Updated 2 years ago
• rkyv / bytecheck
  Memory validation framework for Rust
  ☆65Updated last month
• ConnectEverything / caspaxos-kv
  Rust CASPaxos implementation
  ☆64Updated 4 years ago
• maciejhirsz / ordnung
  Fast, vector-based map implementation that preserves insertion order.
  ☆14Updated 4 years ago
• thyeem / monotree
  An optimized Sparse Merkle Tree in Rust
  ☆45Updated last year
• komora-io / cache-advisor
  scan-resistant concurrent lazy LRU
  ☆58Updated last year
• komora-io / stack-map
  constant-size associative container backed by a simple array
  ☆19Updated last year
• Xaeroxe / c-closures-rs
  Rust closures you can transfer over an FFI boundary
  ☆25Updated 4 years ago
• krl / appendix
  Append-only, on-disk key-value index
  ☆63Updated last year
• tomarrell / rust-elias-fano
  Elias-Fano encoding implementation in Rust
  ☆29Updated 5 years ago
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆53Updated 9 months ago
• eddyb / sobek
  Reverse engineering framework.
  ☆36Updated 2 years ago
• laysakura / fst-rs
  FST (Fast Succinct Trie) implementation in Rust
  ☆24Updated 5 years ago
• asynchronics / st3
  Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
  ☆66Updated 2 months ago