umbrant / QuantileEstimation
Streaming estimation of percentiles, especially high percentiles.
☆63Updated 12 years ago
Alternatives and similar repositories for QuantileEstimation
Users that are interested in QuantileEstimation are comparing it to the libraries listed below
Sorting:
- Lossy Counting and Sticky Sampling implementation for efficient frequency counts on data streams.☆63Updated 8 years ago
- Bitmap compression using the CONCISE algorithm☆43Updated 8 years ago
- Yggdrasil: Faster Decision Trees Using Column Partitioning in Spark☆31Updated 6 years ago
- Simulating the performance of various streaming algorithms. #experimentalmathematics☆59Updated 7 years ago
- Bloofi: A java implementation of multidimensional Bloom filters☆79Updated 9 years ago
- Low latency, strong consistency, fault tolerant distributed key value store. Colocate data and compute to achieve best performance cloud …☆114Updated 9 years ago
- A nozzle to spray a kafka topic at an HTTP endpoint. This project is deprecated and not maintained.☆49Updated 5 years ago
- A collection of algorithms for mining data streams☆203Updated last year
- Myria is a scalable Analytics-as-a-Service platform based on relational algebra.☆113Updated 3 years ago
- Persistent Adaptive Radix Trees in Java☆81Updated 4 years ago
- Secondary index on HBase☆18Updated 9 years ago
- Git mirror for the FastBit library Subversion repository.☆71Updated 8 years ago
- Distributed Matrix Library☆71Updated 8 years ago
- Reduce your data. A unix filter for algebird-powered aggregation.☆138Updated 8 years ago
- Experiments on bit-slice indexing☆13Updated 10 years ago
- Enabling queries on compressed data.☆279Updated last year
- Code to allow running BIDMach on Spark including HDFS integration and lightweight sparse model updates (Kylix).☆15Updated 4 years ago
- A Java implementation of online kernel density estimation (oKDE)☆32Updated 7 years ago
- ☆92Updated 9 years ago
- BlinkDB: Sub-Second Approximate Queries on Very Large Data.☆659Updated 11 years ago
- A lightweight mapping framework that maps data objects to a number of nodes, subject to constraints☆91Updated 8 years ago
- Very Fast Machine Learning Toolkit☆28Updated 12 years ago
- Probabilistic data structures for Guava.☆54Updated 4 years ago
- C network daemon for HyperLogLogs☆448Updated 4 years ago
- Factorization Machines on Spark and Glint☆25Updated 8 years ago
- Iterator library.☆79Updated 5 years ago
- Finite state dictionaries in Java☆130Updated 3 years ago
- Compressing and Decoding Term Statistics Time Series -- ECIR 2016☆10Updated 9 years ago
- Quickstep Project☆27Updated 6 years ago
- Probabilistic data structures server. The data model is key-value, where values are: Bloomfilters, LinearCounters, HyperLogLogs, CountMin…☆25Updated 9 years ago