Alternatives and similar repositories for tongrams:

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

• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆66Updated 3 months ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• fwessels / simdcsv
  ☆36Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• ot / ds2i
  A library of inverted index data structures
  ☆148Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 7 months ago
• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆88Updated 3 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• searchivarius / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆56Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆51Updated 7 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆38Updated 9 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆51Updated last year
• mjansche / opengrm-ngram
  Read-only unofficial mirror of the OpenGrm NGram Library
  ☆8Updated 5 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 8 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆57Updated 2 years ago
• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated last year
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆57Updated 8 months ago
• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆54Updated 2 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆82Updated 3 months ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago
• andralex / MedianOfNinthers
  ☆49Updated 4 years ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆116Updated last year
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 3 years ago