seiflotfy / pcsaLinks
☆37Updated 6 years ago
Alternatives and similar repositories for pcsa
Users that are interested in pcsa are comparing it to the libraries listed below
Sorting:
- Optimal Quantile Approximation in Streams☆163Updated 2 years ago
- HyperMinHash: Bringing intersections to HyperLogLog☆305Updated 7 years ago
- Count-Min Tree Sketch: Approximate counting for NLP☆9Updated 8 years ago
- LogLog based Cardinality Estimator☆63Updated 7 years ago
- Demonstrating the importance of laying out data in memory.☆47Updated 7 years ago
- HyperBitBit☆134Updated 8 years ago
- Quickly detect already witnessed data.☆157Updated last year
- Probabilistic Multiplicity Counting☆49Updated 9 years ago
- A simple database optimized for returning results by custom scoring functions.☆20Updated 9 years ago
- Papers We ❤️ Zurich☆49Updated 6 years ago
- Implementation of KangarooTwelve in Go☆94Updated 4 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- Source of paper “A critique of the CAP theorem”☆16Updated 9 years ago
- A totally proof-of-concept FoundationDB based network block device backend☆115Updated 7 years ago
- Mmap radix sort file by a fixed length prefix of each line☆52Updated 5 years ago
- Cuckoo Filter: Practically better than bloom filter☆81Updated 6 years ago
- Let your tests describe your program behavior☆62Updated 9 years ago
- Secure storage for cryptographic secrets, modeled after sudo☆78Updated 5 years ago
- distkv is a distributed K/V store library for Go powered by the raft consensus algorithm.☆55Updated 8 years ago
- Fabric is a simple triplestore written in Golang☆198Updated 2 years ago
- Package htree implements the in-memory hash tree. Hacker News: https://news.ycombinator.com/item?id=11369676☆92Updated 2 years ago
- Consistent-hashing: Hash ring implementation in Go☆30Updated 5 years ago
- ObjectHash for protocol buffers☆88Updated 5 years ago
- HPACK Compression library for Go☆66Updated 9 years ago
- A simple re-implementation of Google's sparsehash as a learning excercise.☆40Updated last year
- A counter data structure that knows when to start estimating to save space☆35Updated 7 years ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- hokusai -- sketching streams in real-time☆78Updated 8 years ago
- d-left Counting Bloom Filter☆56Updated 9 years ago
- Go implementation of MIDAS: Microcluster-Based Detector of Anomalies in Edge Streams☆188Updated 5 years ago