Alternatives and similar repositories for compression

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

• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last month
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆43Updated 9 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆49Updated 7 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 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
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆78Updated 5 years ago
• fast-pack / LittleIntPacker
  C library to pack and unpack short arrays of integers as fast as possible
  ☆91Updated 2 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆11Updated 9 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• google / berrydb
  ☆66Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆163Updated 10 years ago
• 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
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 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
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 6 years ago