Alternatives and similar repositories for compact_sparse_hash

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

• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 10 months 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.
  ☆34Updated 10 months ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 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 8 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆87Updated 3 weeks ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 7 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 3 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆51Updated 7 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆85Updated 6 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 3 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆250Updated 2 months ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 5 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆17Updated 11 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆15Updated 3 years ago
• gerben-s / quicksort-blog-post
  ☆39Updated 5 years ago
• eloj / radix-sorting
  Radix sorting from the ground up
  ☆38Updated 2 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆68Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆122Updated 5 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 6 years ago