Alternatives and similar repositories for Enhanced-Suffix-Arrays

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

• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆22Updated 12 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• chenshuo / cppindex
  ☆20Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• janneku / btree_db
  A very fast on-disk database for SHA1-identified objects
  ☆57Updated 9 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
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• wheresvic / zsearch
  A high performance search engine
  ☆106Updated 8 years ago
• darabos / pinty
  Toy prototype for a distributed computing system in C++
  ☆18Updated 11 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
• izenecloud / sf1r-lite
  Search Formula-1——A distributed high performance massive data engine for enterprise/vertical search
  ☆169Updated 10 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆75Updated 8 years ago
• jubatus / jubatus-mpio
  mpio for Jubatus
  ☆34Updated 6 years ago
• queertypes / boost-bloom-filters
  A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.
  ☆24Updated 8 years ago
• agentzh / re1
  agentzh's fork of Russ Cox's re1 toy regex library
  ☆19Updated 12 years ago
• viyadb / viyadb
  ViyaDB in-memory columnar analytical data store
  ☆115Updated 6 years ago
• xye7ei / metaparse
  A handy tool to help design and parse your own language
  ☆21Updated 3 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆70Updated 9 years ago
• t3rm1n4l / lightkv
  A light weight, low level embedded key-value database library
  ☆32Updated 12 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 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.
  ☆43Updated 9 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 10 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• jakogut / tinybloom
  A small, simple, easy to use bloom filter written in C.
  ☆35Updated 14 years ago