vteromero / VTEnc

Related projects ⓘ

Alternatives and complementary repositories for VTEnc

• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 4 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 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
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆21Updated 7 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• lemire / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆50Updated 8 months ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 8 months ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆60Updated 9 months ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆16Updated 6 years ago
• richox / zmolly
  PPM compressor with high compression ratio.
  ☆31Updated 6 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆21Updated 2 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆63Updated 3 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 3 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 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 6 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆58Updated 3 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 10 months ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆12Updated 7 months ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆22Updated 4 years ago