Data Structures and Algorithms to maintain Time Aggregation from the paper.
Time is modeled as a non-decreasing integer starting at 0.
The type parameter, T, is the key type. This needs to be numeric. Typical
value is Long, but Short can cut down on size of resulting data structure,
but increased chance of collision. BigInt is another possibility.
From Theorem 4 in the Paper:
At time t, the sketch Mj contains statistics for the period
[t-delta, t-delta-2j] where delta = t mod 2^j
The following shows an example of how data ages through m() as t
starts at 0 and increases:
=== t = 0
t=0 j=0 m is EMPTY
=== t = 1
t=1 j=0 m(0)=[0, 1) # secs in m(0): 1
=== t = 2
t=2 j=0 m(0)=[1, 2) # secs in m(0): 1
t=2 j=1 m(1)=[0, 2) # secs in m(1): 2
=== t = 3
t=3 j=0 m(0)=[2, 3) # secs in m(0): 1
t=3 j=1 m(1)=[0, 2) # secs in m(1): 2
=== t = 4
t=4 j=0 m(0)=[3, 4) # secs in m(0): 1
t=4 j=1 m(1)=[2, 4) # secs in m(1): 2
t=4 j=2 m(2)=[0, 4) # secs in m(2): 4
=== t = 5
t=5 j=0 m(0)=[4, 5) # secs in m(0): 1
t=5 j=1 m(1)=[2, 4) # secs in m(1): 2
t=5 j=2 m(2)=[0, 4) # secs in m(2): 4
=== t = 6
t=6 j=0 m(0)=[5, 6) # secs in m(0): 1
t=6 j=1 m(1)=[4, 6) # secs in m(1): 2
t=6 j=2 m(2)=[0, 4) # secs in m(2): 4
=== t = 7
t=7 j=0 m(0)=[6, 7) # secs in m(0): 1
t=7 j=1 m(1)=[4, 6) # secs in m(1): 2
t=7 j=2 m(2)=[0, 4) # secs in m(2): 4
=== t = 8
t=8 j=0 m(0)=[7, 8) # secs in m(0): 1
t=8 j=1 m(1)=[6, 8) # secs in m(1): 2
t=8 j=2 m(2)=[4, 8) # secs in m(2): 4
t=8 j=3 m(3)=[0, 8) # secs in m(3): 8
=== t = 9
t=9 j=0 m(0)=[8, 9) # secs in m(0): 1
t=9 j=1 m(1)=[6, 8) # secs in m(1): 2
t=9 j=2 m(2)=[4, 8) # secs in m(2): 4
t=9 j=3 m(3)=[0, 8) # secs in m(3): 8
numIntervals The number of sketches to keep in the exponential backoff.
the last one will have a sketch of all data. Default value is 16.
Data Structures and Algorithms to maintain Time Aggregation from the paper. Time is modeled as a non-decreasing integer starting at 0.
The type parameter, T, is the key type. This needs to be numeric. Typical value is Long, but Short can cut down on size of resulting data structure, but increased chance of collision. BigInt is another possibility.
From Theorem 4 in the Paper:
At time t, the sketch Mj contains statistics for the period [t-delta, t-delta-2j] where delta = t mod 2^j
The following shows an example of how data ages through m() as t starts at 0 and increases:
numIntervals The number of sketches to keep in the exponential backoff. the last one will have a sketch of all data. Default value is 16.