chartbeat-labs / wadeLinks
We're All Database Engineers
☆15Updated 9 years ago
Alternatives and similar repositories for wade
Users that are interested in wade are comparing it to the libraries listed below
Sorting:
- A simple database optimized for returning results by custom scoring functions.☆21Updated 9 years ago
- Source of paper “A critique of the CAP theorem”☆16Updated 10 years ago
- gk: streaming quantiles☆45Updated 4 years ago
- counters and logarithmically bucketed histograms for distributed systems☆85Updated 8 years ago
- Probabilistic Multiplicity Counting☆49Updated 10 years ago
- C network daemon for HyperLogLogs☆451Updated 4 years ago
- ☆37Updated 7 years ago
- ☆45Updated 3 years ago
- Event aggregation and indexing system☆53Updated 7 years ago
- Multi-probe consistent hashing☆42Updated 5 years ago
- HyperBitBit☆134Updated 8 years ago
- LogLog based Cardinality Estimator☆63Updated 8 years ago
- HyperMinHash: Bringing intersections to HyperLogLog☆306Updated 7 years ago
- Golomb Coded Sets☆94Updated 8 years ago
- hokusai -- sketching streams in real-time☆77Updated 8 years ago
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams☆37Updated 8 years ago
- Optimal Quantile Approximation in Streams☆163Updated 2 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- A RESTful web service that runs microtasks across multiple crowds, provides quality control techniques, and is easily extensible.☆52Updated 8 years ago
- Myria is a scalable Analytics-as-a-Service platform based on relational algebra.☆116Updated 4 years ago
- Quickly detect already witnessed data.☆156Updated last year
- ObjectHash for protocol buffers☆89Updated 5 years ago
- Last-seen sketch implementation in Go☆16Updated 5 years ago
- ☆40Updated 8 years ago
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆45Updated 2 years ago
- A fault tolerant, distributed task driven framework☆84Updated 10 years ago
- Paxos protocol variants framework☆26Updated 7 years ago
- Probabilistic data structures for processing very large datasets (MinHash, HyperLogLog)☆11Updated 10 years ago
- d-left Counting Bloom Filter☆56Updated 10 years ago
- A Directed Acyclic Graph task dependency scheduler designed to simplify complex distributed pipelines☆132Updated 7 years ago