tudocomp / compact_sparse_hash

Related projects ⓘ

Alternatives and complementary repositories for compact_sparse_hash

• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆57Updated 2 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• jermp / mm_file
  A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.
  ☆25Updated 2 months ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆12Updated 8 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆14Updated 6 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆24Updated 2 months ago
• gnzlbg / nmp
  Non-blocking message passing (a C++14 MPI wrapper)
  ☆18Updated 10 years ago
• KWillets / simd_interleave
  Interleaving bits from two sources using SIMD instructions.
  ☆14Updated 6 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆13Updated 2 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 4 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 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.
  ☆26Updated this week
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 7 years ago
• MartinezTorres / marlin
  Marlin: high throughput entropy compressor
  ☆30Updated last year