Alternatives and similar repositories for interpolative_coding:

Users that are interested in interpolative_coding 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
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆42Updated this week
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆12Updated 3 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆87Updated 5 months ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 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(…
  ☆49Updated 11 months ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 6 months ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆31Updated last year
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years 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.
  ☆29Updated 4 months ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆16Updated 6 years ago