Alternatives and similar repositories for RoSA

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

• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 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
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆22Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• gstrauss / mcdb
  mcdb - fast, reliable, simple code to create and read constant databases
  ☆110Updated 2 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
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆75Updated 8 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated 2 weeks ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆87Updated 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
• commonsmachinery / hmsearch
  C++ implementation of hamming distance algorithm HmSearch using Kyoto Cabinet
  ☆42Updated 9 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• michaelmior / mvptree
  A fork of D Grant Starkweather's multiple vantage point tree library
  ☆41Updated 7 years ago
• apache / lucy
  Mirror of Apache Lucy
  ☆101Updated 7 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 7 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
• pietermartin / thundergraph
  tinkerpop blueprints graphdb on top on lmdb
  ☆20Updated 11 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆163Updated 10 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 10 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 10 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 8 years ago
• gingi / fastbit
  Git mirror for the FastBit library Subversion repository.
  ☆71Updated 9 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆25Updated 11 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆19Updated 11 years ago
• jedisct1 / Pincaster
  A fast persistent nosql database with a HTTP/JSON interface, not only for geographical data.
  ☆172Updated 3 months ago