Alternatives and similar repositories for MergedTrie

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

• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• richox / zmolly
  PPM compressor with high compression ratio.
  ☆32Updated 7 years ago
• wolfgarbe / EliasFanoCompression
  EliasFanoCompression: quasi-succinct compression of sorted integers in C#
  ☆45Updated 3 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆103Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• martinus / better-faster-stronger-mixer
  Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.
  ☆38Updated 4 years ago
• kagiannis / FPC
  FPC - Fast Prefix Coder
  ☆30Updated 3 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 7 years ago
• inikep / XWRT
  XWRT (XML-WRT) is an efficient XML/HTML/text compressor
  ☆41Updated 8 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆155Updated 5 months ago
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 8 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆123Updated last year
• kampersanda / cda-tries
  Compressed double-array tries for static string dictionaries
  ☆11Updated 6 years ago
• apankrat / notes
  Assorted notes
  ☆84Updated last year
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 8 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
• fast-pack / LittleIntPacker
  C library to pack and unpack short arrays of integers as fast as possible
  ☆89Updated 2 years ago
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆69Updated 9 months 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(…
  ☆50Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• geofflangdale / smh
  Shuffle-based predicate matcher and all-round branch free swiss army chainsaw
  ☆17Updated 7 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year