1 repo
Awesome GitHub RepositoriesProbabilistic Data Structures
Data structures that provide approximate answers to membership and frequency queries with high memory efficiency.
Distinguishing note: No existing candidates provided; this category captures memory-efficient approximate data structures like Bloom filters.
Explore 1 awesome GitHub repository matching data & databases · Probabilistic Data Structures. Refine with filters or upvote what's useful.
Awesome Probabilistic Data Structures GitHub Repositories
Find the best repos with AI.We'll search the best matching repositories with AI.
- dragonflydb/dragonfly
dragonflydb/dragonfly
30,022View on GitHubDragonfly is a high-performance, multi-model in-memory data store designed to serve as a drop-in replacement for existing database infrastructures. By utilizing a multi-threaded, shared-nothing architecture and a fiber-based concurrency model, it maximizes CPU utilization and minimizes latency for read and write operations. The system supports a wide range of data structures, including strings, hashes, lists, sets, sorted sets, and JSON documents, while maintaining full compatibility with standard industry wire protocols and client libraries. What distinguishes Dragonfly is its focus on effic
Dragonfly performs probabilistic membership testing using bloom filters to efficiently determine if an element is likely present in a large dataset without scanning all records.
C++cachecppdatabase
