Alternatives and similar repositories for binfuse

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

• orlp / polymur-hash
  The PolymurHash universal hash function.
  ☆357Updated 2 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated last week
• billziss-gh / imap
  Integer Map Data Structure
  ☆133Updated 2 years ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆159Updated 3 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated 2 years ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆98Updated 3 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆51Updated 7 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆415Updated this week
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• kressler / fast-containers
  Performance focused header-only container library. Currently primarily contains a fast B+Tree implementation.
  ☆73Updated 2 weeks ago
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆39Updated 2 years ago
• skarupke / branchless_binary_search
  A fast binary search that tries to be branchless
  ☆105Updated last year
• tidwall / bgen
  B-tree generator for C
  ☆145Updated 2 months ago
• man-group / sparrow
  C++20 idiomatic APIs for the Apache Arrow Columnar Format
  ☆135Updated last week
• danielcota / biski64
  A very fast and robust 64-bit PRNG with a minimum 2^64 period.
  ☆151Updated 7 months ago
• frabert / ClangQL
  Query C++ codebases using SQLite
  ☆188Updated 3 years ago
• JustKshitijD / Harmonia_for_B_plus_trees
  Harmonia is an algorithm that allows for the implementation of operations on B+ trees using parallelization. As a part of my GPU project,…
  ☆31Updated 4 years ago
• vitaut / zmij
  A double-to-string conversion algorithm based on Schubfach and yy
  ☆196Updated this week
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• jart / morton
  ☆296Updated last year
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆96Updated 6 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆132Updated last year
• unum-cloud / UDisk
  The fastest ACID-transactional persisted Key-Value store designed as modified LSM-Tree for NVMe block-devices with GPU-acceleration and S…
  ☆77Updated 2 years ago
• abolz / Drachennest
  Different algorithms for converting binary to decimal floating-point numbers
  ☆128Updated 3 years ago
• google / hashtable-benchmarks
  ☆112Updated last year
• 4rtzel / tfg
  Terminal flame graph
  ☆111Updated 5 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
• gerben-s / quicksort-blog-post
  ☆39Updated 4 years ago
• fanf2 / hg64
  a 64-bit histogram / quantile sketch
  ☆59Updated last year