Alternatives and similar repositories for Enhanced-Suffix-Arrays

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

• queertypes / boost-bloom-filters
  A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.
  ☆24Updated 8 years ago
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆21Updated 11 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 7 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
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• BYVoid / libdarts
  C Library of Double-Array Trie System
  ☆16Updated 11 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• baidu-adu / cpp-primer-digest
  ☆10Updated 8 years ago
• ronmrdechai / Pie
  Provide an idiomatic C++ interface to CPython's C API.
  ☆27Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• jianingy / libtrie
  An Implementation of Two-Trie and Tail-Trie using Double Array
  ☆21Updated 12 years ago
• lantiga / tinydnnc
  ☆11Updated 8 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
• krareT / terark-hashmap
  A very fast and small(memory efficient) hash map
  ☆7Updated 9 years ago
• theck01 / offbrand_lib
  A collecton of generic reference counted data structures, tools to create compatible C style classes, and demo applications
  ☆81Updated last month
• pcarrier / cdb64
  Format-incompatible 64-bit version of cdb (no 4GB limit)
  ☆14Updated 11 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆17Updated 11 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
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• ZhangZhenjie / bed-tree
  A flexible tree-based index structure to support edit distance search on strings
  ☆11Updated 7 years ago
• brycelelbach / coroutines_ts_v1_experience
  Infomation about C++ Coroutines TS v1 software and content
  ☆9Updated 6 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• arminkz / InvertedIndexSearchEngine
  Simple C++/Qt Project for Searching in text files using BST / TST / Trie / Hash Data Structures.
  ☆11Updated 8 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago