ikawaha / mast
Minimal Acyclic Subsequential Transducers
☆26Updated 2 years ago
Alternatives and similar repositories for mast:
Users that are interested in mast are comparing it to the libraries listed below
- A simple column store in golang☆37Updated 8 years ago
- Approximate nearest neighbor search server and dynamic index written in Golang.☆44Updated 5 years ago
- LogLog based Cardinality Estimator☆61Updated 7 years ago
- Bloom-filter based search index☆122Updated 3 years ago
- Multi-probe consistent hashing☆40Updated 4 years ago
- Probabilistic data structures server. The data model is key-value, where values are: Bloomfilters, LinearCounters, HyperLogLogs, CountMin…☆25Updated 9 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆36Updated 4 years ago
- Dremel DB Column Striping and Record Assembly Algorithms in Golang☆21Updated 11 years ago
- sparse levenshtein automaton in go☆23Updated 4 years ago
- HyperLogLog++ for Go☆43Updated 6 years ago
- Compressing and Decoding Term Statistics Time Series -- ECIR 2016☆10Updated 9 years ago
- Teaching implementation of the TurboPFor integer compression algorithm☆22Updated 6 years ago
- A simple database optimized for returning results by custom scoring functions.☆20Updated 8 years ago
- A library of inverted index data structures☆148Updated 2 years ago
- Succinct Data Structure of Trie, written in Go☆42Updated 3 years ago
- doc2vec , word2vec, implemented by golang. word embedding representation☆41Updated 6 years ago
- Library for working with compressed arrays of integers☆65Updated last year
- Mirror of Apache Lucy☆99Updated 6 years ago
- A C++ template library for compact Hamming distance indexes☆10Updated 7 years ago
- A Go implementation of the Elias-Fano encoding☆33Updated 8 months ago
- Persistent Block KD Tree In Golang for Search Filtering☆36Updated last year
- C++ utility library☆24Updated 11 years ago
- A C++ library providing fast language model queries in compressed space.☆129Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- SSE-optimized group varint integer encoding☆37Updated last year
- Bleve Extensions☆48Updated 10 months ago
- ☆15Updated 10 years ago
- Experiments on bit-slice indexing☆13Updated 10 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆41Updated 8 years ago
- An inverted trigram index for accelerated string matching in Sqlite.☆77Updated 10 years ago