Optimal Sampling for Sliding Windows.pptVIP

Optimal Sampling for Sliding Windows Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo UCLA Data Streams: Formal Definition Sequence of elements D=p1,p2,…,pN pi is drawn from a domain [m]. Objective: Calculate a function f(D). Restrictions: single pass, sub-linear memory, ideally polylog(N,m) fast processing time (per element). Sliding Windows Model A sliding window contains n most recent elements that are “active”. Older elements are “expired”. Sliding Windows Model SW contains only most recent elements that are “active”. Older elements are “expired”. Sequence-based Wind