Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order

In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnesic approximation, and out-of-order stream approximation. Our framework essentially develops a popular greedy method of bucket-merging into a more generic form, for which we can prove space-quality approximation bounds. When specialized to piecewise linear bucket approximations and commonly used error metrics, such as L2 or L, our framework leads to provable error bounds where none were known before, offers new results, or yields simpler and unified algorithms. The conceptual simplicity of our scheme translates into highly practical implementations, as borne out in our simulation studies: the algorithms produce nearoptimal approximations, require very small memory footprints, and run extremely fast.

• Type: Conference
• Year: 2010
• Where: ICDE
• Authors: Sorabh Gandhi, Luca Foschini, Subhash Suri
• Keywords: Amnesic Approximation, Database, ICDE 2010, Provable Error Bounds, Space-quality Approximation Bounds