Alternatives and similar repositories for hyperbitbit

Users that are interested in hyperbitbit are comparing it to the libraries listed below

• retailnext / hllpp
  HyperLogLog cardinality estimation algorithm in go/golang!
  ☆60Updated last year
• dustin / go-probably
  Probabilistic Data Structures for Go
  ☆255Updated 6 years ago
• hit9 / htree
  Package htree implements the in-memory hash tree. Hacker News: https://news.ycombinator.com/item?id=11369676
  ☆92Updated 2 years ago
• seiflotfy / loglogbeta
  LogLog based Cardinality Estimator
  ☆62Updated 7 years ago
• dgryski / go-bloomindex
  Bloom-filter based search index
  ☆123Updated 3 years ago
• ashishgandhi / buffer
  A file backed circular buffer for Go. Mmap file into memory. Madvise to lower memory footprint.
  ☆81Updated 7 months ago
• jakewins / 4fq
  Low latency batching queues for Go
  ☆75Updated 8 years ago
• VividCortex / gohistogram
  Streaming approximate histograms in Go
  ☆175Updated 4 years ago
• lukechampine / stm
  Software Transactional Memory in Go
  ☆187Updated 5 years ago
• google / fchan-go
  Experimental channel implementation
  ☆311Updated 8 years ago
• smarty-archives / mafsa
  Package mafsa implements Minimal Acyclic Finite State Automata in Go, essentially a high-speed, memory-efficient, Unicode-friendly set of…
  ☆296Updated 5 years ago
• dgryski / go-bits
  amd64 optimized bit operations
  ☆41Updated 7 years ago
• axiomhq / quantiles
  Optimal Quantile Approximation in Streams
  ☆163Updated 2 years ago
• nieksand / sortgenerics
  Overhead of Go's generic sort
  ☆36Updated 8 years ago
• aybabtme / datagen
  Generate datastructures for your types.
  ☆77Updated 5 years ago
• axiomhq / flipcounter
  A counter data structure that knows when to start estimating to save space
  ☆35Updated 7 years ago
• seiflotfy / dlCBF
  d-left Counting Bloom Filter
  ☆56Updated 9 years ago
• tidwall / celltree
  A fast in-memory prefix tree that uses uint64 for keys and allows for duplicate entries.
  ☆201Updated 4 years ago
• zentures / encoding
  Integer Compression Libraries for Go
  ☆132Updated 7 years ago
• dgryski / interesting-papers
  Interesting papers I'd like to implement (or at least have implementations of)
  ☆122Updated 3 years ago
• jonhoo / cucache
  Fast PUT/GET/DELETE in-memory key-value store for lookaside caching
  ☆63Updated 9 years ago
• benbjohnson / jmphash
  Implementation of the Jump Consistent Hash algorithm in Go.
  ☆153Updated 10 years ago
• cockroachdb / c-rocksdb
  🚫 DEPRECATED
  ☆44Updated 8 years ago
• alexanderGugel / arc
  An Adaptive Replacement Cache (ARC) written in Go.
  ☆222Updated 5 years ago
• seiflotfy / pmc
  Probabilistic Multiplicity Counting
  ☆49Updated 9 years ago
• F483 / dejavu
  Quickly detect already witnessed data.
  ☆157Updated 10 months ago
• slobdell / skew-binomial-queues
  ☆63Updated 2 years ago
• vedhavyas / cuckoo-filter
  Cuckoo Filter: Practically better than bloom filter
  ☆81Updated 6 years ago
• Cistern / cistern
  Event aggregation and indexing system
  ☆53Updated 7 years ago
• teh-cmc / seq
  [Go] seq - a gentle overview of the common ways to tackle the problem of distributed sequential IDs.
  ☆93Updated 8 years ago