Skip to main content

Distribution of Continuous Queries over Data Aggregators in Dynamic Data Dissemination Networks

  • Conference paper
Information and Communication Technologies (ICT 2010)

Abstract

Selecting a query plan for executing continuous aggregate queries over dynamic data using data dissemination networks by optimally distributing the query among different data aggregators is the key issue in improving performance of dynamic data dissemination networks. Optimal execution of continuous queries over dynamic data using data dissemination networks is useful in many online applications like stock market applications. In this paper, we propose a better algorithm, Enhanced greedy algorithm with withdrawals (EGAWW), for dividing the client query into sub-queries and assigning these sub-queries to different data aggregators of dynamic data dissemination networks.

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

Access this chapter

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

References

  1. Gupta, R., Ramamritham, K.: Optimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks. In: WWW 2007, Banff, Alberta, Canada, May 8-12 (2007)

    Google Scholar 

  2. Hassin, R., Levin, A.: A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. SIAM Journal on Computing 35(1) (2005)

    Google Scholar 

  3. Shah, S., Ramamritham, K., Shenoy, P.: Resilient and Coherence preserving Dissemination of Dynamic Data using Cooperating Peers. IEEE Transactions on Knowledge and Data Engineering 16(7) (July 2004)

    Google Scholar 

  4. Vander Meer, D., Datta, A., Dutta, K., Thomas, H., Ramamritham, K.: Proxy-Based Acceleration of Dynamically Generated Content on the World Wide Web. ACM Transactions on Database Systems (TODS) 29 (June 2004)

    Google Scholar 

  5. Ramamritham, K.: Maintaining Coherent Views over Dynamic Distributed Data. In: Janowski, T., Mohanty, H. (eds.) Distributed Computing and Internet Technology. LNCS, vol. 5966, pp. 13–20. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Shah, S., Ramamritham, K.: Handling Non-Linear Polynimial Queries over Dynamic Data. In: Proc. of IEEE International Conference on Data Engineering (April 2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gadiraju, M., Valli Kumari, V. (2010). Distribution of Continuous Queries over Data Aggregators in Dynamic Data Dissemination Networks. In: Das, V.V., Vijaykumar, R. (eds) Information and Communication Technologies. ICT 2010. Communications in Computer and Information Science, vol 101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15766-0_100

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15766-0_100

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15765-3

  • Online ISBN: 978-3-642-15766-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics