Skip to main content

Performing Range Aggregate Queries in Stream Data Warehouse

  • Conference paper
Man-Machine Interactions

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 59))

Abstract

The number of various areas of everyday life where data warehouse systems find their application grows rapidly. They are used not only for business purposes, as it used to be a few years ago, but also in many various domains where huge and rapidly changing data volumes must be stored and processed. More and more often we think about such data volumes as endless data streams which require continuous loading and processing. The concept of data streams results in emerging a new type of data warehouse - a steam data warehouse. Stream data warehouse, when compared to standard data warehouse, differs in many ways, the examples can be a continuous ETL process or data mining models which are always kept upto- date. The process of building stream data warehouse poses many new challenges to algorithms and memory structures designers. The most important concern efficiency and memory complexity of the designed solutions. In this paper we present a stream data warehouse cooperating with a network of sensors monitoring utilities consumption. We focus on a problem of performing range aggregate queries over the sensors and processing data streams generated by the chosen objects.We present a solution which, basing on the results of our previous work, integrate a dedicated memory structure with a spatial aggregating index. The paper includes also practical tests results which show high efficiency and scalability of the proposed solution.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proceedings of the PODS Conference, pp. 1–16 (2002)

    Google Scholar 

  2. Beckerman, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of SIGMOD International Conference on Management of Data, pp. 322–331 (1990)

    Google Scholar 

  3. Bonnet, P., Gehrke, J., Seshadri, P.: Towards sensor database systems. In: Tan, K.-L., Franklin, M.J., Lui, J.C.-S. (eds.) MDM 2001. LNCS, vol. 1987, pp. 3–14. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Gorawski, M., Malczok, R.: On efficient storing and processing of long aggregate lists. In: Proceedings of the International Conference on Data Warehousing and Knowledge Discovery, Copenhagen, Denmark, pp. 190–199 (2005)

    Google Scholar 

  5. Guttman, A.: R-trees: adynamic index structure for spatial searching. In: Proceedings of the SIGMOD Conference, Boston, US, pp. 47–57 (1984)

    Google Scholar 

  6. Hellerstein, J., et al.: Adaptive query processing: Technology in evolution. IEEE Data Engineering Bulletin, 7–18 (2000)

    Google Scholar 

  7. Madden, S., Franklin, M.J.: Fjording the stream: An architecture for queries over streaming sensor data. In: Proceedings of the International Conference on Data Engineering, pp. 555–566 (2002)

    Google Scholar 

  8. Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Effcient OLAP Operations in Spatial Data Warehouses. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, p. 443. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Terry, D., Goldberg, D., Nichols, D., Oki, B.: Continuous queries over append-only databases. In: Proceedings of the SIGMOD Conference, pp. 321–330 (1992)

    Google Scholar 

  10. You, B., Lee, D., Eo, S., Lee, J., Bae, H.: Hybrid index for spatio-temporal OLAP operations. In: Yakhno, T., Neuhold, E.J. (eds.) ADVIS 2006. LNCS, vol. 4243, pp. 110–118. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gorawski, M., Malczok, R. (2009). Performing Range Aggregate Queries in Stream Data Warehouse. In: Cyran, K.A., Kozielski, S., Peters, J.F., StaƄczyk, U., Wakulicz-Deja, A. (eds) Man-Machine Interactions. Advances in Intelligent and Soft Computing, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00563-3_64

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00563-3_64

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00562-6

  • Online ISBN: 978-3-642-00563-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy