Modifier and Type | Interface and Description |
---|---|
interface |
CounterBasedDataStructure<T> |
interface |
IterableDataStructure<T> |
interface |
PointerBasedDataStructure<T,P>
Specifies a data structure in which the elements additionally point to some
object.
|
interface |
SketchBasedDataStructure<T> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractDataStructure<T,P extends DSParameterDefinition> |
Modifier and Type | Method and Description |
---|---|
static <T,PA extends DSParameterDefinition,PO> |
DataStructureFactory.createDataStructure(DataStructure.Type type,
java.util.Map<PA,DSParameter<?>> parameters) |
Modifier and Type | Class and Description |
---|---|
class |
CountMinSketchImpl<T>
Implementation of Count Min Sketch: Paper: An Improved Data Stream Summary:
The Count-Min Sketch and its Applications; Cormode et al.; 2005;
10.1016/j.jalgor.2003.12.001
Code adapted from:
https://github.com/addthis/stream-lib/blob/master/src/main/java/com/
clearspring/analytics/stream/frequency/CountMinSketch.java commit:
9f1bf8bd8d81b4fcaf632a18be90091dd68afd4f
License of the original code: * Licensed under the Apache License, Version
2.0 (the "License"); you may not use this file except in compliance with the
License.
|
class |
PointerBasedCountMinSketch<T,P> |
Modifier and Type | Interface and Description |
---|---|
interface |
DecayDataStructure<T> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractBackwardDecayDataStructureImpl<T,P extends DSParameterDefinition> |
class |
AbstractForwardDecayDataStructureImpl<T,P extends DSParameterDefinition> |
class |
AbstractPointerBasedForwardDecayDataStructure<T,PO,PA extends DSParameterDefinition> |
class |
BackwardExponentialDecayDataStructureImpl<T> |
class |
ForwardExponentialDecayDataStructureImpl<T> |
class |
PointerBasedForwardExponentialDecayDataStructureImpl<T,PO> |
Modifier and Type | Class and Description |
---|---|
class |
FrequentAlgorithmImpl<T>
Stream based implementation of the "Frequent Algorithm" Implementation based
on: Methods for finding frequent items in data streams; Cormode et al; 2010
10.1007/s00778-009-0172-z
Original algorithm described in: A Simple Algorithm for Finding Frequent
Elements in Streams and Bags; Karp et al.; 2003 10.1145/762471.762473
|
class |
PointerBasedFrequentAlgorithmImpl<T,P> |
Modifier and Type | Class and Description |
---|---|
class |
HashSetInfiniteDataStructureImpl<T> |
class |
HashSetInfinitePointerDataStructure<T,P> |
Modifier and Type | Interface and Description |
---|---|
interface |
LossyCounting<T>
A lossy bucket is a collection that implements lossy counting.
|
Modifier and Type | Class and Description |
---|---|
class |
LossyCountingBudgetImpl<T> |
class |
LossyCountingImpl<T>
Lossy bucket algorithm, based on: Approximate Frequency Counts over Data
Streams; Manku et al.; 2002;
|
class |
PointerBasedLossyCountingImpl<T,P> |
Modifier and Type | Interface and Description |
---|---|
interface |
Reservoir<T> |
Modifier and Type | Class and Description |
---|---|
class |
ReservoirImpl<T> |
Modifier and Type | Interface and Description |
---|---|
interface |
SlidingWindow<T> |
Modifier and Type | Class and Description |
---|---|
class |
SlidingWindowImpl<T> |
Modifier and Type | Class and Description |
---|---|
class |
PointerBasedSpaceSavingImpl<T,P> |
class |
SpaceSavingImpl<T>
Implementation of the SpaceSaving algorithm, based on: Methods for finding
frequent items in data streams; Cormode et al; 2010 10.1007/s00778-009-0172-z
Original algorithm: Efficient Computation of Frequent and Top-k Elements in
Data Streams; Metwally et.
|