jmhodges / opposite_of_a_bloom_filterLinks
Implementations of a data structure with false negatives but no false positives.
☆364Updated 2 years ago
Alternatives and similar repositories for opposite_of_a_bloom_filter
Users that are interested in opposite_of_a_bloom_filter are comparing it to the libraries listed below
Sorting:
- C network daemon for HyperLogLogs☆451Updated 4 years ago
- HyperBitBit☆134Updated 8 years ago
- Interactive visualization framework for Runway models of distributed systems☆186Updated 3 years ago
- HyperMinHash: Bringing intersections to HyperLogLog☆307Updated 7 years ago
- Golomb Coded Sets☆94Updated 8 years ago
- Gryadka is a minimalistic master-master replicated consistent key-value storage based on the CASPaxos protocol☆334Updated 7 years ago
- Consus is a geo-replicated transactional key-value store.☆227Updated 7 years ago
- counters and logarithmically bucketed histograms for distributed systems☆85Updated 8 years ago
- A key/value store for serving static batch data☆174Updated 2 years ago
- hokusai -- sketching streams in real-time☆76Updated 8 years ago
- An Adaptive Replacement Cache (ARC) written in Go.☆220Updated 6 years ago
- TAPIR distributed transactional storage system☆424Updated 5 years ago
- Keyvi - a key value index that powers Cliqz search engine. It is an in-memory FST-based data structure highly optimized for size and look…☆178Updated 7 years ago
- Demonstrating the importance of laying out data in memory.☆47Updated 7 years ago
- d-left Counting Bloom Filter☆56Updated 10 years ago
- A time series storage engine for Go☆390Updated 9 years ago
- ☆45Updated 3 years ago
- A generic latency benchmarking library.☆311Updated 8 years ago
- The DB that's replicated, sharded and transactional.☆175Updated 10 years ago
- scaling, counting, bloom filter library☆968Updated 6 years ago
- Distributed Named Pipes☆455Updated 8 years ago
- Timberlake is a Job Tracker for Hadoop.☆177Updated 6 years ago
- columnar storage + NoSQL OLAP engine | https://logv.org☆309Updated last year
- Probabilistic data structures server. The data model is key-value, where values are: Bloomfilters, LinearCounters, HyperLogLogs, CountMin…☆25Updated 10 years ago
- ☆64Updated 3 years ago
- BigTable, Document and Graph Database with Full Text Search☆186Updated 7 years ago
- ☆171Updated 11 years ago
- Having a play with golang, while exploring spectral analysis.☆158Updated 9 years ago
- Probabilistic Data Structures for Go☆258Updated 7 years ago
- Improved Secondary Indexing with new Query Capabilities (OR, scoping) for Cassandra☆145Updated 9 years ago