GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
hyperloglogHere are 182 public repositories matching this topic...Language: All
Filter by language
Sort: Most stars
Sort options
MinHash, LSH, LSH Forest, Weighted MinHash, HyperLogLog, HyperLogLog++, LSH Ensemble and HNSW
python search weighted-quantiles lsh minhash top-k locality-sensitive-hashing lsh-forest lsh-ensemble jaccard-similarity hyperloglog data-sketches data-summary hnsw
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
javascript bloom-filter minhash count-min-sketch cuckoo-filter hyperloglog probabilistic topk invertible-bloom-filter
Fast Web log analyzer using probabilistic data structures
Yet another distributed fault-tolerant key-value database Compatible with Redis written in Golang.
Distributed caching based on StackExchange.Redis and Redis. Includes support for tagging and is cluster-compatible.
redis serialization cache geospatial tagging redis-cluster pubsub netcore redis-client ttl hyperloglog redis-command lexicographical redis-api ttl-cache keyspace-notifications-api
Hyper LogLog (native and sliding) cardinality counters
Skream is a high-performance time-series library with memory-footprint guarantees.
clojure streaming time-series bloom-filter sketching count-min-sketch quantile-estimation hyperloglog online-algorithms streaming-statistics
Dynatrace hash library for Java
java hash-functions hash simhash farmhash xxhash minhash consistent-hashing murmur3 hashing-algorithm hash-algorithm hyperloglog data-sketches cardinality-estimation streaming-algorithms jumphash non-cryptographic-hash-functions superminhash wyhash imohash
Fast and accurate genomic distances using HyperLogLog
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
Sketching Algorithms for Clojure (bloom filter, min-hash, hyper-loglog, count-min sketch)
Fast HyperLogLog for Python.
Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
C# samples for the Redis for .NET Developers blog series using StackExchange.Redis: connecting, strings, hashes, lists, sets, sorted sets, HyperLogLog, pub/sub, pipelining, transactions, Lua scripting, geospatial queries and an ASP.NET Core Web API. .NET Framework and .NET Core.
redis caching lua csharp nosql dotnet code-samples aspnetcore geospatial web-api pubsub transactions dotnet-core pipelining hyperloglog dotnet-framework stackexchange-redis sorted-sets key-value-store redis-tutorial
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
Estimating k-mer coverage histogram of genomics data
Yet another distributed fault-tolerant key-value database Compatible with Redis written in Golang.
redis rocksdb json key-value raft kvstore sharding distributed-database geohash hyperloglog secondary-index
Rust's fastest and most accurate cardinality estimators.
Add this topic to your repoTo associate your repository with the hyperloglog topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |