Alternatives and similar repositories for corsicana:

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

• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 9 years ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆26Updated 4 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• commonsense / conceptdb
  A platform for storing large semantic networks on MongoDB
  ☆22Updated 13 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• tkluck / accumulation_tree
  Red/black tree with support for fast accumulation of values in a key range
  ☆18Updated 5 months ago
• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated last year
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• wesm / bitmaps-vs-sentinels
  ☆9Updated 6 years ago
• HewlettPackard / shoveller
  ☆11Updated 4 years ago
• thm-mni-ii / sea
  Space efficient (graph) algorithms
  ☆18Updated 4 years ago
• kampersanda / dyft
  C++17 Implementation of Dynamic Filter Trie
  ☆8Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 7 years ago
• radujica / baloo
  The bare necessities of Pandas on the Weld runtime
  ☆14Updated 2 years ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆53Updated last year
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 9 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 9 years ago
• queertypes / boost-bloom-filters
  A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.
  ☆23Updated 7 years ago
• phoenix24 / google-all-pairs-similarity-search
  google all pairs similarity search package, with swig bindings
  ☆22Updated 10 years ago
• lintool / JASS
  Anytime Ranking for Impact-Ordered Indexes
  ☆12Updated 8 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• fujimotos / mbleven
  An efficient algorithm for k-bounded (Damerau-)Levenshtein distance
  ☆16Updated 6 years ago
• conda-forge / python-duckdb-feedstock
  A conda-smithy repository for python-duckdb.
  ☆12Updated last month
• pkhuong / aerie
  Aerie: a regex-like engine nested word grammars
  ☆16Updated 3 years ago