Alternatives and similar repositories for stable-bloom-filter

Users that are interested in stable-bloom-filter are comparing it to the libraries listed below

• Gregory-Meyer / cht
  Lockfree resizeable concurrent hash table.
  ☆54Updated 3 years ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆72Updated 8 months ago
• Bajix / evlru
  An eventually consistent LRU designed for lock-free concurrent reads
  ☆23Updated 2 years ago
• tikv / async-speed-limit
  Asynchronously speed-limiting multiple byte streams
  ☆66Updated last year
• komora-io / cache-advisor
  scan-resistant concurrent lazy LRU
  ☆63Updated 2 years ago
• udoprog / unicycle
  A futures abstraction that runs a set of futures which may complete in any order.
  ☆91Updated 2 weeks ago
• ezrosent / art-rs
  Adaptive Radix Tree in Rust
  ☆68Updated 7 years ago
• KuiBaDB / kbio
  Another Async IO Framework based on io_uring
  ☆63Updated 3 years ago
• tokio-rs / simulation
  Framework for simulating distributed applications
  ☆104Updated 5 years ago
• quininer / ritsu
  An experimental asynchronous runtime based on `io-uring`.
  ☆77Updated 4 years ago
• benschulz / paxakos
  Rust implementation of Paxos consensus algorithm
  ☆115Updated 2 years ago
• rolag / lockfreehashmap-rs
  A concurrent lock-free hash map for Rust.
  ☆21Updated 4 years ago
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆115Updated 8 months ago
• vorner / contrie
  Concurrent hash trie
  ☆58Updated 5 years ago
• craftytrickster / stubborn-io
  io traits/structs for tokio that automatically recover from potential disconnections/interruptions
  ☆73Updated last year
• mbajer42 / ucz-dfs
  A distributed file system written in Rust.
  ☆29Updated 4 years ago
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆37Updated 3 years ago
• withoutboats / access-queue
  ☆39Updated 5 years ago
• crepererum-oss / pdatastructs.rs
  Simple probabilistic data structures
  ☆147Updated this week
• laizy / waitgroup-rs
  A lock-free async waitgroup implementation
  ☆37Updated 3 years ago
• survemobility / gaffer
  Prioritised, parallel job scheduler with concurrent exclusion, job merging, recurring jobs and load limiting for lower priorities.
  ☆46Updated 3 years ago
• ragona / clobber
  TCP load testing tool, written in async Rust
  ☆36Updated 4 years ago
• hmwill / tokio-linux-aio
  Support for Linux kernel aio within Tokio.
  ☆51Updated 4 years ago
• Kerollmops / slice-group-by
  An implementation of the `group_by` Haskell function for slice and strings
  ☆54Updated 2 years ago
• photondb / photonio
  An efficient runtime for asynchronous applications in Rust.
  ☆43Updated 2 years ago
• prataprc / xorfilter
  Rust library implementing xor-filters
  ☆142Updated 2 years ago
• khonsulabs / sediment
  A low-level MVCC file format for storing blobs.
  ☆64Updated last year
• asynchronics / st3
  Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.
  ☆84Updated last year
• async-rs / async-global-executor
  A global executor built on top of async-executor and smol
  ☆74Updated 2 months ago
• saligrama / concache
  A linked-list based, lock-free concurrent hashmap in Rust.
  ☆164Updated 5 years ago