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
• dgryski / go-bits
  amd64 optimized bit operations
  ☆41Updated 7 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
  ☆63Updated 7 years ago
• dustin / go-probably
  Probabilistic Data Structures for Go
  ☆258Updated 7 years ago
• F483 / dejavu
  Quickly detect already witnessed data.
  ☆157Updated last year
• fabian-z / distkv
  distkv is a distributed K/V store library for Go powered by the raft consensus algorithm.
  ☆55Updated 9 years ago
• slobdell / skew-binomial-queues
  ☆63Updated 3 years ago
• dgryski / interesting-papers
  Interesting papers I'd like to implement (or at least have implementations of)
  ☆122Updated 4 years ago
• traildb / traildb-go
  Go bindings for TrailDB
  ☆47Updated 5 years ago
• dgryski / go-bloomindex
  Bloom-filter based search index
  ☆125Updated 3 years ago
• glycerine / bambam
  auto-generate capnproto schema from your golang source files. Depends on go-capnproto-1.0 at https://github.com/glycerine/go-capnproto
  ☆64Updated 9 years ago
• ninibe / netlog
  A lightweight, HTTP-centric, log-based (Kafka-like) message queue.
  ☆188Updated 6 years ago
• axiomhq / quantiles
  Optimal Quantile Approximation in Streams
  ☆163Updated 2 years ago
• google / fchan-go
  Experimental channel implementation
  ☆311Updated 8 years ago
• benbjohnson / jmphash
  Implementation of the Jump Consistent Hash algorithm in Go.
  ☆153Updated 10 years ago
• axiomhq / flipcounter
  A counter data structure that knows when to start estimating to save space
  ☆34Updated 8 years ago
• dgryski / go-kll
  KLL sketch: Almost Optimal Streaming Quantiles
  ☆35Updated 9 years ago
• teh-cmc / seq
  [Go] seq - a gentle overview of the common ways to tackle the problem of distributed sequential IDs.
  ☆93Updated 9 years ago
• alexanderGugel / arc
  An Adaptive Replacement Cache (ARC) written in Go.
  ☆221Updated 6 years ago
• ashishgandhi / buffer
  A file backed circular buffer for Go. Mmap file into memory. Madvise to lower memory footprint.
  ☆81Updated last year
• VividCortex / gohistogram
  Streaming approximate histograms in Go
  ☆176Updated 4 years ago
• jonhoo / cucache
  Fast PUT/GET/DELETE in-memory key-value store for lookaside caching
  ☆63Updated 10 years ago
• tidwall / celltree
  A fast in-memory prefix tree that uses uint64 for keys and allows for duplicate entries.
  ☆203Updated 4 years ago
• lukechampine / stm
  Software Transactional Memory in Go
  ☆187Updated 5 years ago
• aybabtme / datagen
  Generate datastructures for your types.
  ☆77Updated 6 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…
  ☆295Updated 6 years ago
• dgryski / go-lttb
  Implementation of Largest-Triangle-Three-Buckets down-sampling algorithm
  ☆72Updated 2 years ago
• Cistern / cistern
  Event aggregation and indexing system
  ☆53Updated 7 years ago
• collinglass / mw
  Middleware decorator for go servers.
  ☆37Updated 10 years ago