Alternatives and similar repositories for MaskedVByte

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

• fast-pack / LittleIntPacker
  C library to pack and unpack short arrays of integers as fast as possible
  ☆92Updated 2 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆47Updated 6 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• 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
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 6 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 years ago
• fast-pack / simdcomp
  A simple C library for compressing lists of integers using binary packing
  ☆515Updated 2 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago
• fanf2 / qp
  qp tries and crit-bit tries
  ☆124Updated 3 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 3 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 5 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated last year
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆88Updated 8 years ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆281Updated last year
• Bulat-Ziganshin / FARSH
  Fast and Reliable (but not Secure) Hash
  ☆55Updated 7 years ago
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆413Updated 11 months ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆44Updated 9 years ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆190Updated last year
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆104Updated 6 years ago
• powturbo / Turbo-Histogram
  Fastest Histogram Construction
  ☆74Updated 4 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆66Updated last year