Alternatives and similar repositories for Enhanced-Suffix-Arrays

Users that are interested in Enhanced-Suffix-Arrays are comparing it to the libraries listed below

• ronmrdechai / Pie
  Provide an idiomatic C++ interface to CPython's C API.
  ☆27Updated 7 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 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
• queertypes / boost-bloom-filters
  A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.
  ☆23Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆21Updated 11 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• ZhangZhenjie / bed-tree
  A flexible tree-based index structure to support edit distance search on strings
  ☆11Updated 7 years ago
• jianingy / libtrie
  An Implementation of Two-Trie and Tail-Trie using Double Array
  ☆21Updated 12 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆15Updated 8 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• pcarrier / cdb64
  Format-incompatible 64-bit version of cdb (no 4GB limit)
  ☆14Updated 11 years ago
• richox / zmolly
  PPM compressor with high compression ratio.
  ☆32Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• johnj / llds
  Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel
  ☆120Updated 2 years ago
• Amaury / AngstromDB
  Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.
  ☆14Updated 11 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• lantiga / tinydnnc
  ☆11Updated 8 years ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 10 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• antirez / nn-2003
  2003 Neural Networks experiments -- when it was not mainstream ;-)
  ☆18Updated 8 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• baidu-adu / cpp-primer-digest
  ☆10Updated 8 years ago
• chokkan / dastrie
  Static Double Array Trie (DASTrie)
  ☆31Updated 13 years ago
• abique / melon
  M:N fiber implementation, with transparent IO reactor and timeouts, POSIX like APIs.
  ☆16Updated 13 years ago