xhochy / libfuzzymatchLinks
C++11 library for fast fuzzy searching
☆14Updated 10 years ago
Alternatives and similar repositories for libfuzzymatch
Users that are interested in libfuzzymatch are comparing it to the libraries listed below
Sorting:
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- nkvdb - is a numeric time-series database.☆35Updated 8 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- bit & sketches data structures☆60Updated 6 years ago
- High-performance dictionary coding☆104Updated 8 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
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆9Updated 8 years ago
- Iterator library.☆79Updated 5 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Propositional Encodings in C++11☆18Updated 6 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- ☆26Updated 8 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 12 years ago
- ☆49Updated 5 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 10 years ago
- Compact Data Structures Library☆127Updated 10 years ago
- A system for maintaining replicated state machines☆115Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Succinct Data Structure Library☆106Updated 11 years ago
- A simple database optimized for returning results by custom scoring functions.☆20Updated 9 years ago