Alternatives and similar repositories for protobuf-zerocopy-compression:

Users that are interested in protobuf-zerocopy-compression are comparing it to the libraries listed below

• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 8 years ago
• cameron314 / microbench
  A lightweight (3 file, single function) library for running micro-benchmarks on C++ code
  ☆77Updated 9 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
  ☆51Updated 11 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 7 months ago
• jubatus / jubatus-mpio
  mpio for Jubatus
  ☆34Updated 5 years ago
• yandex / mms
  Memory-mapped storage library
  ☆76Updated 8 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• google / hashing-demo
  Sample implementation of a proposed C++ hashing framework
  ☆29Updated 9 years ago
• scylladb / fmt
  Small, safe and fast formatting library
  ☆16Updated 6 years ago
• lemire / fasthashing
  A Variable-Length String Hashing Library in C++
  ☆44Updated 5 years ago
• google / berrydb
  ☆66Updated 4 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 7 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆103Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆28Updated 2 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆18Updated 10 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• chriskohlhoff / awesome
  Example program for BoostCon11 talk
  ☆37Updated 13 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆51Updated 7 years ago
• KWillets / simd_interleave
  Interleaving bits from two sources using SIMD instructions.
  ☆14Updated 6 years ago
• google / varstruct
  ☆18Updated 7 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆79Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year