Reservoir sampling maintains a sample that is a "sketch" of the whole data. Existing reservoir sampling methods introduced by J.S Vitter are based on simple random sampling. These algorithms work fine for larger sampling ratios but for small sampling ratios, their performance drops drastically. Note that for streaming data, it is quintessential that the sampling algorithm works efficiently particularly for a very small ratio because streaming data is potentially infinite in size. We proposed a distance based sampling (DSS) for transactional data streams. DSS is designed to produce samples that are "close" to the whole data. It assures the accuracy of the final sample even at very small sampling ratios. Experimental comparison between DSS algorithm and the existing reservoir sampling methods shows that DSS outperforms them significantly particularly for small sample ratios
[1]
Jeffrey Scott Vitter,et al.
Random sampling with a reservoir
,
1985,
TOMS.
[2]
Rajeev Motwani,et al.
Approximate Frequency Counts over Data Streams
,
2012,
VLDB.
[3]
Theodore Johnson,et al.
Sampling algorithms in a stream operator
,
2005,
SIGMOD '05.
[4]
Bin Chen,et al.
Efficient data reduction with EASE
,
2003,
KDD '03.
[5]
Yossi Matias,et al.
Fast incremental maintenance of approximate histograms
,
1997,
TODS.
[6]
Jennifer Widom,et al.
Models and issues in data stream systems
,
2002,
PODS.