Approximate query on historical stream data

Authors:
Qiyang Duan;Peng Wang;MingXi Wu;Wei Wang;Sheng Huang
Affiliations:
Fudan Unversity, Shanghai, China;Fudan Unversity, Shanghai, China;Oracle Corporation, Redwood shores, CA;Fudan Unversity, Shanghai, China;Fudan Unversity, Shanghai, China and 399 Keyuan RoadShanghai, China
Venue:
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Year:
2011

Citing 9
Cited 0

Fast subsequence matching in time-series databases

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Approximate computation of multidimensional aggregates of sparse data using wavelets

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Multi-dimensional selectivity estimation using compressed histogram information

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Approximate query processing using wavelets

The VLDB Journal — The International Journal on Very Large Data Bases
Stream Cube: An Architecture for Multi-Dimensional Analysis of Data Streams

Distributed and Parallel Databases
Approximate Query Processing in Cube Streams

IEEE Transactions on Knowledge and Data Engineering
Indexable PLA for efficient similarity search

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Querying and mining of time series data: experimental comparison of representations and distance measures

Proceedings of the VLDB Endowment
Managing massive time series streams with multi-scale compressed trickles

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new Stream OLAP framework to approximately answer queries on historical stream data, in which each cell is extended from a single value to a synopsis structure. The cell synopses can be constructed by the existing well researched methods, including Fourier, DCT, Wavelet, PLA, etc. To implement the Cube aggregation operation, we develop algorithms that aggregate multiple lower level synopses into a single higher level synopsis for those synopsis methods. Our experiments provide comparison among all used synopsis methods, and confirm that the synopsis cells can be accurately aggregated to a higher level.