頻度計数サマリを構成する決定性近似アルゴリズムの予備的検討

抄録

In this study, we focus on an itemset-frequency (IF) sketch of a given transactional data stream. Let I be the universe of items and S = ?e1, . . . , en? a stream where each ei ⊆ I is a transaction appearing at timestamp i. The proposed sketch can answer an approximation of the frequency f(q) for any query q ⊆ I within a bounded error ratio ?. This paper provides a deterministic algorithm that constructs an ?-deficient IF sketch in the online manner.