Hashing-function agnostic Cuckoo filters for Redis
-
Updated
Mar 5, 2020 - Zig
#
probabilistic-data-structures
Here are 69 public repositories matching this topic...
Simple probabilistic data structures
-
Updated
Feb 29, 2024 - Rust
Probabilistic Data Structures and Algorithms in Python
-
Updated
Feb 24, 2020 - Python
🌺 A pure Elixir implementation of Scalable Bloom Filters
-
Updated
Jun 8, 2021 - Elixir
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
hashing cuckoo-filter probabilistic-data-structures membership-query probabilistic-filters membership-queries cuckoofilter mortonfilter morton-filter
-
Updated
Dec 16, 2020 - C++
Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
-
Updated
Aug 14, 2024 - Rust
Production-ready Cuckoo Filters for any C ABI compatible target.
-
Updated
Jan 10, 2023 - Zig
Bloomfilter written in Golang, includes rotation and RPC
-
Updated
Sep 18, 2024 - Go
Cuckoo Filter: Practically better than bloom filter
-
Updated
May 2, 2019 - Go
A probabilistic data structures library for C#
c-sharp csharp bloom-filter count-min-sketch cuckoo-filter hyperloglog scalable-bloom-filters counting-bloom-filters stable-bloom-filters probabilistic-data-structures
-
Updated
May 14, 2021 - C#
🐦 Cuckoo Filters in Elixir
-
Updated
Jun 8, 2021 - Elixir
Fast Bloom filter with concurrent accessibility, powered by :atomics module.
-
Updated
Dec 8, 2020 - Elixir
An in-memory bloom filter with persistence and HTTP interface
bloom bloom-filters bloom-filter bloomfilter probabilistic bloom-server probabilistic-data-structures bloom-persistent
-
Updated
Aug 9, 2020 - C
Erlang nif for xor_filter. 'Faster and Smaller Than Bloom and Cuckoo Filters'.
-
Updated
Dec 2, 2021 - C
Probabilistic Data Structure Template Library
big-data datastructures cpp14 bloom-filter template-library probabilistic-data-structures quotient-filter
-
Updated
Jun 18, 2020 - C++
A Go implementation of an in-memory bloom filter, with support for boltdb and badgerdb as optional data persistent storage.
-
Updated
Mar 5, 2022 - Go
A family of randomized, history-independent search tree data structures
-
Updated
Aug 27, 2024 - TypeScript
Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
-
Updated
Feb 10, 2019 - C++
🦀 Bloom filter implementation in Rust 🦀
-
Updated
Nov 18, 2020 - Rust
Production-ready Java implementation of the Xor Filter.
-
Updated
Jan 23, 2020 - Java
Improve this page
Add a description, image, and links to the probabilistic-data-structures topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the probabilistic-data-structures topic, visit your repo's landing page and select "manage topics."