Alternatives and similar repositories for s_indexes:

Users that are interested in s_indexes 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 / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• 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 2 months ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 11 months ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• sillycross / mlpds
  MlpIndex - Extremely fast ordered index via memory level parallelism
  ☆12Updated 5 years ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 5 months ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 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
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated 2 months ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆64Updated last year
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago