Skip to main content

Approximate Query on Historical Stream Data

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6861))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Reeves, G., Liu, J., Nath, S., Zhao, F.: Managing massive time series streams with multiscale compressed trickles. In: PVLDB, vol. 2(1), pp. 97–108 (2009), http://www.vldb.org/pvldb/2/vldb09-434.pdf

  2. Aggarwal, C.C., Yu, P.S.: A Survey of Synopsis Construction in Data Streams, pp. 169–207. Springer, US (2007), http://www.springerlink.com/content/wx43561lv4678637/

    Google Scholar 

  3. Vitter, J.S., Wang, M.: Approximate computation of multidimensional aggregates of sparse data using wavelets. In: SIGMOD Conference, pp. 193–204 (1999)

    Google Scholar 

  4. Chakrabarti, K., Garofalakis, M.N., Rastogi, R., Shim, K.: Approximate query processing using wavelets. VLDB J. 10(2-3), 199–223 (2001), http://link.springer.de/link/service/journals/00778/bibs/1010002/10100199.htm

    MATH  Google Scholar 

  5. Yun-Bo Xiong, Y.-F.H., Liu, B.: Approximate query processing based on wavelet transform. In: Proceedings of the Fifth International Conference on Machine Learning and Cybernetics, Dalian, pp. 13–16 (2006)

    Google Scholar 

  6. Karras, P., Mamoulis, N.: The haar+ tree: A refined synopsis data structure. In: ICDE, pp. 436–445. IEEE, Los Alamitos (2007), http://dx.doi.org/10.1109/ICDE.2007.367889

    Google Scholar 

  7. Hsieh, M.-J., Chen, M.-S., Yu, P.S.: Approximate query processing in cube streams. IEEE Trans. Knowl. Data Eng. 19(11), 1557–1570 (2007), http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.190622

    Article  Google Scholar 

  8. Chen, Q., Chen, L., Lian, X., Liu, Y., Yu, J.X.: Indexable PLA for efficient similarity search. In: Proceedings of the 33rd International Conference on Very Large Data Bases, Austria, September 23-27, pp. 435–446. ACM, New York (2007)

    Google Scholar 

  9. Han, J., Chen, Y., Dong, G., Pei, J., Wah, B.W., Wang, J., Cai, Y.D.: Stream cube: An architecture for multi-dimensional analysis of data streams. Distributed and Parallel Databases 18(2), 173–197 (2005), http://dx.doi.org/10.1007/s10619-005-3296-1

    Article  Google Scholar 

  10. Stein, E.M., Shakarchi, R.: Fourier Analysis I: An Introduction, pp. 134–140. Princeton University Press, Princeton (2003)

    MATH  Google Scholar 

  11. Smith.III, J.O.: Mathematics Of The Discrete Fourier Transform (DFT) With Audio Applications. W3K Publishing (2007)

    Google Scholar 

  12. Lee, J.-H., Kim, D.-H., Chung, C.-W.: Multi-dimensional selectivity estimation using compressed histogram information. In: Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, pp. 205–214. ACM, New York (1999), http://doi.acm.org/10.1145/304182.304200

    Chapter  Google Scholar 

  13. Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time-series databases. In: Proceedings of ACM SIGMOD, Minneapolis, MN, pp. 419–429 (1994)

    Google Scholar 

  14. Duan, Q.: Stream data collection (2011), http://sites.google.com/site/qiyangduan/publications/stream-data-set

  15. Ding, H., Trajcevski, G., Scheuermann, P., Wang, X., Keogh, E.J.: Querying and mining of time series data: experimental comparison of representations and distance measures. In: PVLDB, vol. 1(2), pp. 1542–1552 (2008), http://www.vldb.org/pvldb/1/1454226.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duan, Q., Wang, P., Wu, M., Wang, W., Huang, S. (2011). Approximate Query on Historical Stream Data. In: Hameurlain, A., Liddle, S.W., Schewe, KD., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2011. Lecture Notes in Computer Science, vol 6861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23091-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23091-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23090-5

  • Online ISBN: 978-3-642-23091-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics