commonsmachinery / hmsearchLinks
C++ implementation of hamming distance algorithm HmSearch using Kyoto Cabinet
☆42Updated 9 years ago
Alternatives and similar repositories for hmsearch
Users that are interested in hmsearch are comparing it to the libraries listed below
Sorting:
- 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
- Golomb Coded Sets☆94Updated 8 years ago
- Reduced on-disk Suffix Array☆22Updated 12 years ago
- An efficient, immutable, persistent mapping object☆98Updated 6 years ago
- HAT-Trie for Python☆87Updated 9 years ago
- Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.☆44Updated 11 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- Compilation and rule-based optimization framework for relational algebra. Raco is the language, optimization, and query translation layer…☆74Updated 7 years ago
- C++ utility library☆24Updated 11 years ago
- A simple proof of concept levenshtein automaton in Python☆108Updated 10 years ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- immutable sorted string table library☆82Updated 10 months ago
- Fast decoder for VByte-compressed integers☆125Updated 2 weeks ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆43Updated 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 4 years ago
- A column oriented, embarrassingly distributed relational event database.☆238Updated 7 years ago
- mcdb - fast, reliable, simple code to create and read constant databases☆110Updated 2 years ago
- Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering☆78Updated 3 years ago
- Locality-sensitive hashing algorithm for text similarity comparisons☆58Updated 7 months 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☆22Updated 5 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- Fast directed acyclic word graph generator☆92Updated 7 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated 10 months ago
- a hash-based key-value database for persistent storing massive small records☆41Updated 11 years ago
- A scalable, fast, consistent graph store☆213Updated 9 years ago
- Simhashing in C++☆135Updated 2 years ago
- pythonic access to fastbit☆26Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- C based graph db server using tokyocabinet & libevent☆299Updated 7 years ago