Skip to main content
Springer Nature Link
Log in

Processing of Continuous Queries over Unlimited Data Streams

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2453))

Included in the following conference series:

  • 1426 Accesses

Abstract

This workaddresses the problem of continuous query processing over infinite data streams. The paper defines new semantics for continuous queries and describes a continuous query processing system based on the concepts of continuous computations and online algorithms. A new programming control structure called as Continuous Iterator is proposed for implementation of continuous computations. The paper describes the semantics of three types of Continuous Iterators (composition, merge, and elimination), compares the iterators with the traditional relational algebra operations and proposes implementation of the iterators. The results of preliminary experiments are provided as well.

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

Access this chapter

Log in via an institution

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

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. Shivnath Babu and Jennifer Widom, “Continuous queries over data streams,” SIGMOD Record, vol. 30, no. 3, pp. 109–120, 2001.

    Article  Google Scholar 

  2. Ehsan Vossough and Janusz Getta “ Blocklev el Query Scrambling Algorithm within Distributed Multi-database Environment,” 4th IEEE Intl. workshop on Parallel and Distributed Databases: Innovative Applications and New Architectures, PADD2001, Munich, pp. 123–127, 2001.

    Google Scholar 

  3. Ehsan Vossough, “ Adaptable Processing of Large Data Sets in Distributed Environments,” EDBT 8th International Conference on Extending Databases Technology, pp. 109–120, 2002.

    Google Scholar 

  4. Lars Baekgaard and Leo Mark, “Incremental computation of time-varying query expressions,” IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 4, pp. 583–590, 1995.

    Article  Google Scholar 

  5. Avnur R. Hellerstein, “Eddies: Continuously adaptive query processing,” in Proc. ACM-SIGMOD International Conference on Management of Data, 1998, pp. 106–117.

    Google Scholar 

  6. Jianjun Chen, David J. DeWitt, Feng Tian, and Yuang Wang, “Niagaracq: A scalable continuous query systems for internet databases,” in Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 379–390.

    Google Scholar 

  7. Amos Fiat and Gerhard J. Woeginger, On Line Algorithms, The State of the Art, Springer Verlag, 1998.

    Google Scholar 

  8. Joseph M. Hellerstein, Peter J. Haas, and Helen J. Wang, “Online aggregation,” in Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, 1997, SIGMOD Record, pp. 171–182.

    Google Scholar 

  9. Joseph M. Hellerstein, J. Franklin, M. Chandrasekaran, S. Deshpande, A. Hildrum, K. Madden, S. Raman, and V. Shah, “Adaptive query processing: Technology in evolution,” in Bulletin of the IEEE Computer Society Technical committee on Data Engineering, 2000, IEEE, pp. 7–18.

    Google Scholar 

  10. D. M. Yellin and R. E. Storm, “Inc: A language for incremental computations,” IBM T. J. Watson Research Center, ACM Transactions on Programming Languages and Systems,, no. 2, pp. 211–236, 1991.

    Google Scholar 

  11. H. V. Jagadish, I.S. Mumick, and A. Silberschatz, “View maintenance issues for the chronicle data model,” in Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 1995, SIGMOD Record, pp. 113–124.

    Google Scholar 

  12. N. D. Jones, “Mix ten years later,” in ACM SIGPLANSymp osium on Partial Evaluation and Semantics-Based Program Manipulation, 1995, pp. 24–38.

    Google Scholar 

  13. V. Srinivasan and Michael J. Carey, “Compensation-based on-line query processing,” in Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, 1992, pp. 331–340.

    Google Scholar 

  14. Mark Sullio van, “Tribeca: A stream database manager for network traffic analysis,” in Proceedings of the 22nd VLDB Conference, 1996, p. 594.

    Google Scholar 

  15. Douglas Terry, David Goldberg, David Nichols, and Brian Oki, “Continuous queries over append-only databases,” in Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, 1992, pp. 321–330.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Information Technology, University of Western Sydney, NSW, Macarthur, Australia

    Ehsan Vossough

  2. School of Information Technology and Computer Science, University of Wollongong, NSW, Wollongong, Australia

    Janusz R. Getta

Authors
  1. Ehsan Vossough
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Janusz R. Getta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Paul Sabatier, IRIT, 118 route de Narbonne, 31062, Toulouse Cedex, France

    Abdelkader Hameurlain

  2. Département Informatique, Université Aix-Marseille II, IUT, 413 Avenue Gaston Berger, 13625, Aix-en-Provence Cedex 1, France

    Rosine Cicchetti

  3. Institute of Applied Computer Science, University of Linz, Altenbergerstr. 69, 4040, Linz, Austria

    Roland Traunmüller

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vossough, E., Getta, J.R. (2002). Processing of Continuous Queries over Unlimited Data Streams. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2002. Lecture Notes in Computer Science, vol 2453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46146-9_79

Download citation

  • DOI: https://doi.org/10.1007/3-540-46146-9_79

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44126-7

  • Online ISBN: 978-3-540-46146-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation