Data Streams: Algorithms and ApplicationsNow Publishers Inc, 2005 - 126 pages Data stream algorithms as an active research agenda emerged only over the past few years, even though the concept of making few passes over the data for performing computations has been around since the early days of Automata Theory. The data stream agenda now pervades many branches of Computer Science including databases, networking, knowledge discovery and data mining, and hardware systems. Industry is in synch too, with Data Stream Management Systems (DSMSs) and special hardware to deal with data speeds. Even beyond Computer Science, data stream concerns are emerging in physics, atmospheric science and statistics. Data Streams: Algorithms and Applications focuses on the algorithmic foundations of data streaming. In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerged for reasoning about algorithms that work within these constraints on space, time and number of passes. Some of the methods rely on metric embeddings, pseudo-random computations, sparse approximation theory and communication complexity. The applications for this scenario include IP network traffic analysis, mining text message streams and processing massive data sets in general. Data Streams: Algorithms and Applications surveys the emerging area of algorithms for processing data streams and associated applications. An extensive bibliography with over 200 entries points the reader to further resources for exploration. |
Contents
Introduction | 1 |
Formal Aspects | 15 |
Basic Mathematical Ideas | 29 |
Basic Algorithmic Techniques | 51 |
Summary | 67 |
Historic Notes | 109 |
Common terms and phrases
analysis appear applications approach approximation bits bucket Carole cash register model challenge communication complexity compute Consider count currently data stream algorithms data stream models data structure database define determine developed dictionary different discussed distinct distributed domain elements error estimate example find flows follows function Further given gives graph heavy hitters Hence histogram independent input interesting inverse IP addresses known least lower bound maintain mapped memory methods monitoring multiple multiset natural needs nodes norms observations optimal packets particular passes Paul position presented probability problem Proc processing puzzle quantiles queries random recent represent representation sampling seen Series shows signal simple sketch solution solve space statistics string suitable takes Theorem theory tion traffic tree Turnstile model typically updates vectors