commonsmachinery / hmsearch
C++ implementation of hamming distance algorithm HmSearch using Kyoto Cabinet
☆42Updated 8 years ago
Alternatives and similar repositories for hmsearch:
Users that are interested in hmsearch are comparing it to the libraries listed below
- C++ utility library☆24Updated 11 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
- Reduced on-disk Suffix Array☆21Updated 11 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 9 years ago
- C version of the MetroHash function☆25Updated 9 years ago
- An inverted trigram index for accelerated string matching in Sqlite.☆77Updated 10 years ago
- a hash-based key-value database for persistent storing massive small records☆41Updated 10 years ago
- Golomb Coded Sets☆91Updated 7 years ago
- Simhashing in C++☆133Updated last year
- C++11 library for fast fuzzy searching☆14Updated 9 years ago
- Interactive SQL analytics in your browser!☆22Updated 7 years ago
- 📑 SQLite extension to add the Okapi BM25 ranking algorithm☆35Updated 9 years ago
- Eblob is an append-only low-level IO library, which saves data in blob files. Created as low-level backend for elliptics☆104Updated 5 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- An efficient, immutable, persistent mapping object☆98Updated 5 years ago
- Various utilities regarding Levenshtein transducers.☆67Updated 4 years ago
- Git mirror for the FastBit library Subversion repository.☆71Updated 8 years ago
- C library for efficient string matching with Aho-Corasick☆21Updated 13 years ago
- Jeremy's Machine Learning Library☆52Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Redis is an in-memory database that persists on disk. The data model is key-value, but many different kind of values are supported: Strin…☆129Updated 10 years ago
- A C++ template library for compact Hamming distance indexes☆10Updated 7 years ago
- ☆88Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- An almost deterministic top k elements counter Redis module☆35Updated 5 years ago
- Experimental search engine in C/C++17 - still in early development.☆26Updated 3 months ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Mirror of Apache Lucy☆99Updated 6 years ago