ZhangZhenjie / bed-treeLinks
A flexible tree-based index structure to support edit distance search on strings
☆11Updated 7 years ago
Alternatives and similar repositories for bed-tree
Users that are interested in bed-tree are comparing it to the libraries listed below
Sorting:
- A flexible implementation of enhanced suffix arrays in template based C++. Supports single and multi-position wildcard. Fast queries than…☆20Updated 4 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 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
- Feed-forward Bloom filters☆52Updated 14 years ago
- Stream processing engine☆12Updated 4 years ago
- Accurate counters with Kafka & RocksDB.☆16Updated 4 years ago
- Static Double Array Trie (DASTrie)☆31Updated 13 years ago
- Reduced on-disk Suffix Array☆21Updated 11 years ago
- ☆13Updated 6 years ago
- Perseus is a set of scripts (docker+javascript) to investigate a distributed database's responsiveness when one of its three nodes is iso…☆49Updated 6 years ago
- simd enabled column imprints☆11Updated 7 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Diamond reactive programming platform☆25Updated 3 years ago
- A system for maintaining replicated state machines☆115Updated 8 years ago
- ☆11Updated 7 years ago
- Quickstep Project☆27Updated 6 years ago
- Neural Network engine for Veles distributed machine learning platform☆27Updated 9 years ago
- Iterator library.☆79Updated 5 years ago
- Weighted linear regression☆15Updated 4 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Automatic MongoDB database designer☆54Updated 10 years ago
- ☆26Updated 8 years ago
- Jubatus algorithm component☆20Updated 6 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆9Updated 8 years ago
- Experiments on bit-slice indexing☆13Updated 10 years ago
- ☆14Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A framework for building reranking models.☆28Updated 10 years ago
- A collection of efficient utilities for a data scientist.☆41Updated 10 years ago