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
- Reduced on-disk Suffix Array☆21Updated 11 years ago
- An inverted trigram index for accelerated string matching in Sqlite.☆77Updated 10 years ago
- immutable sorted string table library☆80Updated 3 months ago
- ☆89Updated last year
- C library for efficient string matching with Aho-Corasick☆21Updated 13 years ago
- Golomb Coded Sets☆91Updated 7 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Keyvi - a key value index that powers Cliqz search engine. It is an in-memory FST-based data structure highly optimized for size and look…☆177Updated 6 years ago
- Simhashing in C++☆132Updated 2 years ago
- A C++ template library for compact Hamming distance indexes☆10Updated 8 years ago
- 📑 SQLite extension to add the Okapi BM25 ranking algorithm☆35Updated 9 years ago
- C based graph db server using tokyocabinet & libevent☆296Updated 7 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Raw Benchmark Data for Popular Machine Learning Frameworks☆56Updated 7 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆10Updated 7 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
- A fork of D Grant Starkweather's multiple vantage point tree library☆41Updated 7 years ago
- Fast decoder for VByte-compressed integers☆122Updated 11 months ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- hokusai -- sketching streams in real-time☆78Updated 7 years ago
- Format-incompatible 64-bit version of cdb (no 4GB limit)☆14Updated 11 years ago
- Count-Min sketch-based approximate counting library☆45Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 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
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- C++ utility library☆24Updated 11 years ago
- A simple database optimized for returning results by custom scoring functions.☆20Updated 9 years ago
- Language Detection based on Chromium's Compact Language Detector library☆106Updated 4 years ago