Alternatives and similar repositories for sux

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

• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• google / hashtable-benchmarks
  ☆111Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 2 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆53Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆314Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆120Updated 8 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆84Updated 6 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆50Updated 5 months ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆89Updated 8 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆287Updated 3 months ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆269Updated 4 months ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated 2 weeks ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 8 months ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆32Updated 7 months ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆159Updated 3 weeks ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 5 years ago