This package is the parent package for all sketch algorithms.
Compressed Probabilistic Counting
This package is dedicated to streaming algorithms that enable estimation of the frequency of occurence of items in a weighted multiset stream of items.
The hash package contains a high-performing and extended Java implementation of Austin Appleby's 128-bit MurmurHash3 hash function originally coded in C.
The hll package contains a high performance implementation of Phillipe Flajolet's HLL sketch with significantly improved error behavior.
The hllmap package contains a space efficient HLL mapping sketch of keys to approximate unique count of identifiers.
The quantiles package contains stochastic streaming algorithms that enable single-pass analysis of the distribution of a stream of real (double) values or generic items.
This package is dedicated to streaming algorithms that enable fixed size, uniform sampling of unweighted items from a stream.
The theta package contains all the sketch classes that are members of the Theta Sketch Framework.
The tuple package contains implementation of sketches based on the idea of theta sketches with the addition of values associated with unique keys.
The Sketching Core Library provides a range of stochastic streaming algorithms and closely related java technologies that are particularly useful when integrating this technology into systems that must deal with massive data. Click on the package links below for the package introduction and APIs.
This library is divided into packages that constitute distinct groups of functionality:
Copyright © 2015–2020 The Apache Software Foundation. All rights reserved.