simongog / RoSALinks
Reduced on-disk Suffix Array
☆22Updated 11 years ago
Alternatives and similar repositories for RoSA
Users that are interested in RoSA are comparing it to the libraries listed below
Sorting:
- Feed-forward Bloom filters☆52Updated 14 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- ☆26Updated 8 years ago
- A library to support streaming data applications☆24Updated 4 years ago
- Library containing high-performance datastructures and utilities for C++☆74Updated 8 years ago
- A system for maintaining replicated state machines☆115Updated 8 years ago
- Mirror of Apache Lucy☆99Updated 7 years ago
- tinkerpop blueprints graphdb on top on lmdb☆20Updated 11 years ago
- ARTful radix tree☆13Updated 8 years ago
- A flexible implementation of enhanced suffix arrays in template based C++. Supports single and multi-position wildcard. Fast queries than…☆20Updated 4 years ago
- Golomb Coded Sets☆94Updated 8 years ago
- 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
- Fast decoder for VByte-compressed integers☆124Updated last year
- Compact Data Structures Library☆101Updated 3 years ago
- Algorithms to compress sorted arrays of integers☆18Updated 11 years ago
- C based ordered key-value ACID DB using a skip list data structure☆163Updated 10 years ago
- Compact Data Structures Library☆128Updated 10 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- C++ implementation of hamming distance algorithm HmSearch using Kyoto Cabinet☆42Updated 9 years ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- mcdb - fast, reliable, simple code to create and read constant databases☆110Updated 2 years ago
- A fork of D Grant Starkweather's multiple vantage point tree library☆41Updated 7 years ago
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 9 years ago
- 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 3 years ago