Alternatives and similar repositories for wyHLL

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

• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆59Updated 6 months ago
• afiodorov / radixmmap
  Mmap radix sort file by a fixed length prefix of each line
  ☆52Updated 5 years ago
• BenJoyenConseil / rmi
  A learned index structure
  ☆53Updated 4 years ago
• scandum / wolfsort
  Wolfsort is a stable adaptive hybrid radix / merge sort.
  ☆196Updated 11 months ago
• gueststar / nthm
  Non-preemptive Thread Hierarchy Manager
  ☆55Updated 8 months ago
• DO-SAY-GO / beamsplitter
  Beamsplitter - A new (possibly universal) hash that passes SMHasher. Built mainly with a random 10x64 S-box. Also in NodeJS
  ☆91Updated 2 months ago
• backtrace-labs / stuffed-record-stream
  Backtrace.io's resilient log record framing format
  ☆38Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• seiflotfy / pcsa
  ☆37Updated 6 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• kyotov / kysync
  ☆80Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• Keith-Cancel / k-hash
  A simple single header 64 and 32 bit hash function using only add, sub, ror, and xor.
  ☆78Updated 3 years ago
• rgov / sqlite_protobuf
  A SQLite extension for extracting values from serialized Protobuf messages
  ☆88Updated 3 weeks ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆32Updated last year
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• WojciechMula / base64-avx512
  Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"
  ☆204Updated 5 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆156Updated 5 months ago
• axiomhq / hyperminhash
  HyperMinHash: Bringing intersections to HyperLogLog
  ☆303Updated 7 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• TCGV / ConsensusKit
  Implementation of popular consensus protocols
  ☆21Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆99Updated 3 years ago
• eloraiby / tcpm
  Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)
  ☆40Updated 6 years ago
• hashlookup / fleur
  Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.
  ☆117Updated 2 years ago
• juliusgeo / branchless_bisect
  Beating the `bisect` module's implementation using C-extensions.
  ☆30Updated 2 years ago
• DO-SAY-GO / DISCoHAsH
  DISCoHAsH - Simple, fast, quality hash in 120 lines. 10GB/s serial (depending on hardware). Also in NodeJS
  ☆218Updated 2 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• tezc / resql
  Lightweight SQL database with replication
  ☆67Updated 2 years ago