Alternatives and similar repositories for RoSA

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

• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• commonsmachinery / hmsearch
  C++ implementation of hamming distance algorithm HmSearch using Kyoto Cabinet
  ☆42Updated 9 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆75Updated 8 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆87Updated 9 years ago
• apache / lucy
  Mirror of Apache Lucy
  ☆101Updated 7 years ago
• hermanstehouwer / Enhanced-Suffix-Arrays
  A flexible implementation of enhanced suffix arrays in template based C++. Supports single and multi-position wildcard. Fast queries than…
  ☆21Updated 5 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
• gstrauss / mcdb
  mcdb - fast, reliable, simple code to create and read constant databases
  ☆111Updated 2 years ago
• patrickfrey / strus
  Library implementing the storage and the query evaluation for a text search engine. It uses on a key value store database interface to st…
  ☆47Updated 4 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆19Updated 11 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• stevedekorte / vertexdb
  C based graph db server using tokyocabinet & libevent
  ☆299Updated 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.
  ☆43Updated 9 years ago
• michaelmior / mvptree
  A fork of D Grant Starkweather's multiple vantage point tree library
  ☆41Updated 7 years ago
• pietermartin / thundergraph
  tinkerpop blueprints graphdb on top on lmdb
  ☆20Updated 11 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• google / szl
  A compiler and runtime for the Sawzall language
  ☆70Updated 6 years ago
• rads / sqlite-okapi-bm25
  📑 SQLite extension to add the Okapi BM25 ranking algorithm
  ☆35Updated 10 years ago
• brentp / fastbit-python
  pythonic access to fastbit
  ☆26Updated 7 years ago
• pcarrier / cdb64
  Format-incompatible 64-bit version of cdb (no 4GB limit)
  ☆15Updated 11 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆25Updated 11 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 11 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 10 years ago
• toffaletti / libten
  C++11 library for network services on modern x86_64 Linux
  ☆87Updated 10 years ago