Alternatives and similar repositories for FastPFOR

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

• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆443Updated 6 months ago
• powturbo / TurboPFor-Integer-Compression
  Fastest Integer Compression
  ☆823Updated last year
• fast-pack / simdcomp
  A simple C library for compressing lists of integers using binary packing
  ☆515Updated 2 years ago
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆413Updated 11 months ago
• RoaringBitmap / CRoaring
  Roaring bitmaps in C (and C++), with SIMD (AVX2, AVX-512 and NEON) optimizations: used by Apache Doris, ClickHouse, Alibaba Tair, Redpand…
  ☆1,769Updated this week
• cwida / fsst
  Fast Static Symbol Table (FSST): efficient random-access string compression
  ☆491Updated 2 months ago
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆354Updated last year
• Tessil / hat-trie
  C++ implementation of a fast and memory efficient HAT-trie
  ☆853Updated 2 months ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆446Updated last year
• armon / libart
  Adaptive Radix Trees implemented in C
  ☆816Updated 3 years ago
• efficient / libcuckoo
  A high-performance, concurrent hash table
  ☆1,732Updated 10 months ago
• powturbo / Turbo-Run-Length-Encoding
  TurboRLE-Fastest Run Length Encoding
  ☆289Updated 2 years ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆360Updated last year
• kiyo-masui / bitshuffle
  Filter for improving compression of typed binary data.
  ☆233Updated last year
• Blosc / c-blosc
  A blocking, shuffling and loss-less compression library that can be faster than `memcpy()`.
  ☆1,040Updated last month
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆496Updated 2 years ago
• efficient / SuRF
  First Practical and General-purpose Range Filter
  ☆550Updated 3 years ago
• gvinciguerra / PGM-index
  🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of item…
  ☆864Updated last year
• lemire / EWAHBoolArray
  A compressed bitmap class in C++.
  ☆460Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆289Updated 5 months ago
• Tessil / hopscotch-map
  C++ implementation of a fast hash map and hash set using hopscotch hashing
  ☆765Updated 3 months ago
• tlk00 / BitMagic
  BitMagic Library
  ☆441Updated 5 months ago
• sparsehash / sparsehash-c11
  Experimental C++11 version of sparsehash
  ☆294Updated 3 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆274Updated 6 months ago
• greg7mdp / sparsepp
  A fast, memory efficient hash map for C++
  ☆1,299Updated 8 months ago
• apache / parquet-cpp
  Apache Parquet
  ☆446Updated last year
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆317Updated 4 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆127Updated 2 months ago
• lemire / fast_double_parser
  Fast function to parse strings into double (binary64) floating-point values, enforces the RFC 7159 (JSON standard) grammar: 4x faster tha…
  ☆668Updated 8 months ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆366Updated 3 months ago