AntonioFerrandez / MergedTrie

Related projects ⓘ

Alternatives and complementary repositories for MergedTrie

• wolfgarbe / EliasFanoCompression
  EliasFanoCompression: quasi-succinct compression of sorted integers in C#
  ☆42Updated 3 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• richox / zmolly
  PPM compressor with high compression ratio.
  ☆31Updated 6 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆115Updated 7 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆80Updated 10 months ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 5 months ago
• lemire / dictionary
  High-performance dictionary coding
  ☆103Updated 7 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• 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
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 6 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆82Updated last month
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆98Updated 7 months ago
• Bulat-Ziganshin / FARSH
  Fast and Reliable (but not Secure) Hash
  ☆53Updated 6 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆60Updated 9 months ago
• lemire / fasthashing
  A Variable-Length String Hashing Library in C++
  ☆43Updated 5 years ago
• leni536 / fast_hilbert_curve
  Fast caclulation of the coordinates of the nth point of the Hilbert curve
  ☆17Updated 5 years ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆21Updated 3 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆157Updated last month