Chapter 8. Algorithms for Data Streams
- Amiya Nayak B.Math., Ph.D. Adjunct Research Professor Associate Editor Full Professor2,
- Ivan Stojmenović Ph.D. Chair Professor founder editor-in-chief2,3
Published Online: 1 MAR 2007
DOI: 10.1002/9780470175668.ch8
Copyright © 2008 John Wiley & Sons, Inc.
Book Title

Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems
Additional Information
How to Cite
Demetrescu, C. and Finocchi, I. (2007) Algorithms for Data Streams, in Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems (eds A. Nayak and I. Stojmenović), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470175668.ch8
Editor Information
- 2
SITE, University of Ottawa, 800 King Edward Ave., Ottawa, ON K1N 6N5, Canada
- 3
EECE, University of Birmingham, UK
Publication History
- Published Online: 1 MAR 2007
- Published Print: 14 FEB 2008
ISBN Information
Print ISBN: 9780470044926
Online ISBN: 9780470175668
- Summary
- Chapter
Keywords:
- data stream algorithms;
- algorithm design techniques;
- PRAM algorithms and PRAM model
Summary
Data stream processing has recently gained increasing popularity as an effective paradigm for processing massive data sets. A wide range of applications in computational sciences generate huge and rapidly changing data streams that need to be continuously monitored in order to support exploratory analyses and to detect correlations, rare events, fraud, intrusion, and unusual or anomalous activities. Relevant examples include monitoring network traffic, online auctions, transaction logs, telephone call records, automated bank machine operations, and atmospheric and astronomical events. Due to the high sequential access rates of modern disks, streaming algorithms can also be effectively deployed for processing massive files on secondary storage, providing new insights into the solution of several computational problems in external memory. Streaming models constrain algorithms to access the input data in one or few sequential passes, using only a small amount of working memory and processing each input item quickly. Solving computational problems under these restrictions poses several algorithmic challenges.
