Data streams: algorithms and applications

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.

[1]  George Kingsley Zipf,et al.  Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology , 2012 .

[2]  Yuen Ren Chao,et al.  Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology , 1950 .

[3]  I. Good THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS , 1953 .

[4]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[5]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[6]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[7]  C. Mallows,et al.  A Method for Simulating Stable Random Variables , 1976 .

[8]  C. K. Yuen,et al.  Walsh Functions and Their Applications , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Jayadev Misra,et al.  Finding Repeated Elements , 1982, Sci. Comput. Program..

[12]  Michael J. Fischer,et al.  Finding a Majority Among N Votes. , 1982 .

[13]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[14]  Philippe Flajolet,et al.  Probabilistic counting , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[15]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

[16]  Peter Winkler,et al.  Three Thresholds for a Liar , 1992, Combinatorics, Probability and Computing.

[17]  George G. Lorentz,et al.  Constructive Approximation , 1993, Grundlehren der mathematischen Wissenschaften.

[18]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[19]  Kenneth Baclawski,et al.  Quickly generating billion-record synthetic databases , 1994, SIGMOD '94.

[20]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[21]  Uzi Vishkin,et al.  Symmetry breaking for suffix tree construction , 1994, STOC '94.

[22]  S. Muthukrishnan,et al.  On optimal strategies for searching in presence of errors , 1994, SODA '94.

[23]  Ketan Mulmuley,et al.  Computational geometry - an introduction through randomized algorithms , 1993 .

[24]  Sunita Sarawagi,et al.  Query Processing in Tertiary Memory Databases , 1995, VLDB.

[25]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[26]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[27]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[28]  Peter Winkler,et al.  Comparing information without leaking it , 1996, CACM.

[29]  M. Weiser,et al.  THE COMING AGE OF CALM TECHNOLOGY[1] , 1996 .

[30]  Uzi Vishkin,et al.  Efficient approximate and dynamic matching of patterns using a labeling paradigm , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[31]  Rajeev Motwani,et al.  Incremental clustering and dynamic information retrieval , 1997, STOC '97.

[32]  S. Mallat,et al.  Adaptive greedy approximations , 1997 .

[33]  John Seely Brown,et al.  The coming age of calm technolgy , 1997 .

[34]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[35]  Alexander A. Razborov,et al.  Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus , 1997, STOC '97.

[36]  L. Villemoes Best Approximation with Walsh Atoms , 1997 .

[37]  U. Feige A threshold of ln n for approximating set cover , 1998, JACM.

[38]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[39]  Vladimir N. Temlyakov,et al.  The best m-term approximation and greedy algorithms , 1998, Adv. Comput. Math..

[40]  Alan M. Frieze,et al.  Min-wise independent permutations (extended abstract) , 1998, STOC '98.

[41]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.

[42]  Rajeev Motwani,et al.  Random sampling for histogram construction: how much is enough? , 1998, SIGMOD '98.

[43]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[44]  Olaf Boettger,et al.  Beyond Calculation: : The Next Fifty Years of Computing , 1998 .

[45]  Torsten Suel,et al.  On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications , 1999, ICDT.

[46]  Bruce G. Lindsay,et al.  Random sampling techniques for space efficient online computation of order statistics of large datasets , 1999, SIGMOD '99.

[47]  Piotr Indyk,et al.  A small approximately min-wise independent family of hash functions , 1999, SODA '99.

[48]  S. Muthukrishnan,et al.  Mining Deviants in a Time Series Database , 1999, VLDB.

[49]  Noga Alon,et al.  Tracking join and self-join sizes in limited storage , 1999, PODS '99.

[50]  Surajit Chaudhuri,et al.  Self-tuning histograms: building histograms without looking at data , 1999, SIGMOD '99.

[51]  Uzi Vishkin,et al.  Communication complexity of document exchange , 1999, SODA '00.

[52]  Anne Rogers,et al.  Hancock: a language for extracting signatures from data streams , 2000, KDD '00.

[53]  Avi Wigderson,et al.  An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs , 2000, JACM.

[54]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.

[55]  David J. DeWitt,et al.  NiagaraCQ: a scalable continuous query system for Internet databases , 2000, SIGMOD '00.

[56]  Sudipto Guha,et al.  Clustering Data Streams , 2000, FOCS.

[57]  S. Muthukrishnan,et al.  Approximate nearest neighbors and sequence comparison with block operations , 2000, STOC '00.

[58]  Gregory Piatetsky-Shapiro,et al.  High-Dimensional Data Analysis: The Curses and Blessings of Dimensionality , 2000 .

[59]  Richard Cole,et al.  On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof , 2000, SIAM J. Comput..

[60]  Alan M. Frieze,et al.  Min-Wise Independent Permutations , 2000, J. Comput. Syst. Sci..

[61]  Prabhakar Raghavan,et al.  Graph Structure of the Web: A Survey , 2000, LATIN.

[62]  Nick G. Duffield,et al.  Trajectory sampling for direct traffic observation , 2000, TNET.

[63]  Sanjeev Khanna,et al.  Space-efficient online computation of quantile summaries , 2001, SIGMOD '01.

[64]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[65]  Phillip B. Gibbons Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports , 2001, VLDB.

[66]  Divesh Srivastava,et al.  On computing correlated aggregates over continual data streams , 2001, SIGMOD '01.

[67]  Graham Cormode,et al.  Permutation Editing and Matching via Embeddings , 2001, ICALP.

[68]  Leonard Pitt,et al.  Sublinear time approximate clustering , 2001, SODA '01.

[69]  Anna C. Gilbert,et al.  QuickSAND: Quick Summary and Analysis of Network Data , 2001 .

[70]  Dimitris Achlioptas,et al.  Fast computation of low rank matrix approximations , 2001, STOC '01.

[71]  Jessica H. Fong,et al.  An Approximate Lp Difference Algorithm for Massive Data Streams , 1999, Discret. Math. Theor. Comput. Sci..

[72]  Sudipto Guha,et al.  Data-streams and histograms , 2001, STOC '01.

[73]  S. Muthukrishnan,et al.  Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries , 2001, VLDB.

[74]  Srikanta Tirthapura,et al.  Estimating simple functions on the union of data streams , 2001, SPAA '01.

[75]  Piotr Indyk,et al.  Maintaining stream statistics over sliding windows: (extended abstract) , 2002, SODA '02.

[76]  Ziv Bar-Yossef,et al.  Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.

[77]  Yixin Chen,et al.  Multi-Dimensional Regression Analysis of Time-Series Data Streams , 2002, VLDB.

[78]  Piotr Indyk,et al.  Maintaining Stream Statistics over Sliding Windows , 2002, SIAM J. Comput..

[79]  Moses Charikar,et al.  Finding frequent items in data streams , 2002, Theor. Comput. Sci..

[80]  Rajeev Motwani,et al.  Approximate Frequency Counts over Data Streams , 2012, VLDB.

[81]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[82]  Theodore Johnson,et al.  Mining database structure; or, how to build a data quality browser , 2002, SIGMOD '02.

[83]  Theodore Johnson,et al.  Gigascope: high performance network monitoring with an SQL interface , 2002, SIGMOD '02.

[84]  Sudipto Guha,et al.  Histogramming Data Streams with Fast Per-Item Processing , 2002, ICALP.

[85]  Benny Pinkas,et al.  Cryptographic techniques for privacy-preserving data mining , 2002, SKDD.

[86]  Mahesh Viswanathan,et al.  An Approximate L1-Difference Algorithm for Massive Data Streams , 2002, SIAM J. Comput..

[87]  Luca Trevisan,et al.  Counting Distinct Elements in a Data Stream , 2002, RANDOM.

[88]  Steve Chien,et al.  Clifford algebras and approximating the permanent , 2002, STOC '02.

[89]  S. Muthukrishnan,et al.  How to Summarize the Universe: Dynamic Maintenance of Quantiles , 2002, VLDB.

[90]  Graham Cormode,et al.  The string edit distance matching problem with moves , 2002, SODA '02.

[91]  Ravi Kumar,et al.  Approximate counting of inversions in a data stream , 2002, STOC '02.

[92]  Sudipto Guha,et al.  Near-optimal sparse fourier representations via sampling , 2002, STOC '02.

[93]  Alexander S. Szalay,et al.  Petabyte Scale Data Mining: Dream or Reality? , 2002, SPIE Astronomical Telescopes + Instrumentation.

[94]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[95]  S. Muthukrishnan,et al.  Estimating Rarity and Similarity over Data Stream Windows , 2002, ESA.

[96]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[97]  Sudipto Guha,et al.  Dynamic multidimensional histograms , 2002, SIGMOD '02.

[98]  Corinna Cortes,et al.  Communities of interest , 2001, Intell. Data Anal..

[99]  Devavrat Shah,et al.  Maintaining Statistics Counters in Router Line Cards , 2002, IEEE Micro.

[100]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[101]  Sudipto Guha,et al.  Fast, small-space algorithms for approximate histogram maintenance , 2002, STOC '02.

[102]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[103]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[104]  Greg Humphreys,et al.  Chromium: a stream-processing framework for interactive rendering on clusters , 2002, SIGGRAPH.

[105]  Divesh Srivastava,et al.  Reverse Nearest Neighbor Aggregates Over Data Streams , 2002, VLDB.

[106]  Michael E. Saks,et al.  Space lower bounds for distance approximation in the data stream model , 2002, STOC '02.

[107]  Erik D. Demaine,et al.  Identifying frequent items in sliding windows over on-line packet streams , 2003, IMC '03.

[108]  Suresh Venkatasubramanian The Graphics Card as a Streaming Computer , 2003, ArXiv.

[109]  Malik Magdon-Ismail,et al.  Locating Hidden Groups in Communication Networks Using Hidden Markov Models , 2003, ISI.

[110]  Michael Stonebraker,et al.  Aurora: a data stream management system , 2003, SIGMOD '03.

[111]  Guy E. Blelloch,et al.  Space-efficient finger search on degree-balanced search trees , 2003, SODA '03.

[112]  Rina Panigrahy,et al.  Better streaming algorithms for clustering problems , 2003, STOC '03.

[113]  George Varghese,et al.  New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice , 2003, TOCS.

[114]  Suresh Venkatasubramanian The Graphics Card as a Stream Computer , 2003 .

[115]  Sudipto Guha,et al.  Application of the two-sided depth test to CSG rendering , 2003, I3D '03.

[116]  S. Muthukrishnan,et al.  Checks and Balances , 2003 .

[117]  S. Muthukrishnan,et al.  Maintenance of Multidimensional Histograms , 2003, FSTTCS.

[118]  P. Indyk,et al.  Comparing Data Streams Using Hamming Norms (How to Zero In) , 2002, Very Large Data Bases Conference.

[119]  Balachander Krishnamurthy,et al.  Sketch-based change detection: methods, evaluation, and applications , 2003, IMC '03.

[120]  Michael Stonebraker,et al.  Aurora: a new model and architecture for data stream management , 2003, The VLDB Journal.

[121]  Alon Orlitsky,et al.  Always Good Turing: Asymptotically Optimal Probability Estimation , 2003, Science.

[122]  S. Muthukrishnan,et al.  Approximation of functions over redundant dictionaries using coherence , 2003, SODA '03.

[123]  Divesh Srivastava,et al.  Finding Hierarchical Heavy Hitters in Data Streams , 2003, VLDB.

[124]  S. Muthukrishnan,et al.  Rangesum histograms , 2003, SODA '03.

[125]  Yaron Minsky,et al.  Set reconciliation with nearly optimal communication complexity , 2003, IEEE Trans. Inf. Theory.

[126]  Jennifer Widom,et al.  STREAM: the stanford stream data manager (demonstration description) , 2003, SIGMOD '03.

[127]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, PODS '03.

[128]  Graham Cormode,et al.  Estimating Dominance Norms of Multiple Data Streams , 2003, ESA.

[129]  Graham Cormode Stable Distributions for Stream Computations : it ’ s as easyas 0 , 1 , 2 , 2003 .

[130]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[131]  Subhash Khot,et al.  Near-optimal lower bounds on the multi-party communication complexity of set disjointness , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[132]  Frederick Reiss,et al.  TelegraphCQ: An Architectural Status Report , 2003, IEEE Data Eng. Bull..

[133]  Theodore Johnson,et al.  The Gigascope Stream Database , 2003, IEEE Data Eng. Bull..

[134]  George Varghese,et al.  Automatically inferring patterns of resource consumption in network traffic , 2003, SIGCOMM '03.

[135]  Anupam Gupta,et al.  Counting inversions in lists , 2003, SODA '03.

[136]  S. Muthukrishnan,et al.  Improved sparse approximation over quasiincoherent dictionaries , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

[137]  Petros Drineas,et al.  Pass efficient algorithms for approximating large matrices , 2003, SODA '03.

[138]  Jennifer Widom,et al.  STREAM: The Stanford Stream Data Manager , 2003, IEEE Data Eng. Bull..

[139]  Piotr Indyk,et al.  Better algorithms for high-dimensional proximity problems via asymmetric embeddings , 2003, SODA '03.

[140]  Theodore Johnson,et al.  Exploratory Data Mining and Data Cleaning , 2003 .

[141]  Richard M. Karp,et al.  A simple algorithm for finding frequent elements in streams and bags , 2003, TODS.

[142]  David P. Woodruff,et al.  Tight lower bounds for the distinct elements problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[143]  Frederick Reiss,et al.  TelegraphCQ: Continuous Dataflow Processing for an Uncertain World , 2003, CIDR.

[144]  Ronitt Rubinfeld,et al.  Algorithms column: sublinear time algorithms , 2003, SIGA.

[145]  Divesh Srivastava,et al.  Holistic UDAFs at streaming speeds , 2004, SIGMOD '04.

[146]  Benny Pinkas,et al.  Secure Computation of the k th-Ranked Element , 2004, EUROCRYPT.

[147]  Corinna Cortes,et al.  Signature-Based Methods for Data Streams , 2001, Data Mining and Knowledge Discovery.

[148]  Su-Liang Chen,et al.  Wireless in loco Sensor Data Collection and Applications , 2004 .

[149]  Michael Stonebraker,et al.  Load management and high availability in the Medusa distributed stream processing system , 2004, SIGMOD '04.

[150]  Moses Charikar,et al.  Finding frequent items in data streams , 2004, Theor. Comput. Sci..

[151]  Sudipto Guha,et al.  Inferring Mixtures of Markov Chains , 2004, COLT.

[152]  Srinivasan Seshan,et al.  Synopsis diffusion for robust aggregation in sensor networks , 2004, SenSys '04.

[153]  Ravi Kumar,et al.  An information statistics approach to data stream and communication complexity , 2004, J. Comput. Syst. Sci..

[154]  Rebecca N. Wright,et al.  Experimental Analysis of Privacy-Preserving Statistics Computation , 2004, Secure Data Management.

[155]  David P. Woodruff Optimal space lower bounds for all frequency moments , 2004, SODA '04.

[156]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[157]  Jeffrey Scott Vitter,et al.  Mining deviants in time series data streams , 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..

[158]  Divesh Srivastava,et al.  Diamond in the rough: finding Hierarchical Heavy Hitters in multi-dimensional data , 2004, SIGMOD '04.

[159]  Piotr Indyk,et al.  Algorithms for dynamic geometric problems over data streams , 2004, STOC '04.

[160]  Ravi Kumar,et al.  An improved data stream algorithm for frequency moments , 2004, SODA '04.

[161]  Joan Feigenbaum,et al.  Computing Diameter in the Streaming and Sliding-Window Models , 2002, Algorithmica.

[162]  Piotr Indyk,et al.  Streaming Algorithms for Geometric Problems , 2004, FSTTCS.

[163]  Michael Elkin,et al.  Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models , 2004, PODC '04.

[164]  Divyakant Agrawal,et al.  Medians and beyond: new aggregation techniques for sensor networks , 2004, SenSys '04.

[165]  George Varghese,et al.  On the difficulty of scalably detecting network attacks , 2004, CCS '04.

[166]  David Eppstein,et al.  Deterministic sampling and range counting in geometric data streams , 2004, SCG '04.

[167]  Jon M. Kleinberg,et al.  Bursty and Hierarchical Structure in Streams , 2002, Data Mining and Knowledge Discovery.

[168]  Gurmeet Singh Manku,et al.  Approximate counts and quantiles over sliding windows , 2004, PODS.

[169]  What's new: finding significant differences in network data streams , 2004, IEEE INFOCOM 2004.

[170]  Carsten Lund,et al.  Flow sampling under hard resource constraints , 2004, SIGMETRICS '04/Performance '04.

[171]  Rajeev Rastogi,et al.  Tracking set-expression cardinalities over continuous update streams , 2004, The VLDB Journal.

[172]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[173]  Csaba D. Tóth,et al.  Range counting over multidimensional data streams , 2004, SCG '04.

[174]  Carsten Lund,et al.  Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications , 2004, IMC '04.

[175]  Subhash Suri,et al.  Adaptive sampling for geometric problems over data streams , 2004, PODS.

[176]  Amit Kumar,et al.  Deterministic wavelet thresholding for maximum-error metrics , 2004, PODS.

[177]  Edith Cohen,et al.  Spatially-decaying aggregation over a network: model and algorithms , 2004, SIGMOD '04.

[178]  Christopher Olston,et al.  Finding (recently) frequent items in distributed data streams , 2005, 21st International Conference on Data Engineering (ICDE'05).

[179]  Rebecca N. Wright,et al.  Privacy-preserving distributed k-means clustering over arbitrarily partitioned data , 2005, KDD '05.

[180]  S. Muthukrishnan,et al.  Detecting malicious network traffic using inverse distributions of packet contents , 2005, MineNet '05.

[181]  Y. Matias,et al.  Optimal workload-based weighted wavelet synopses , 2005, Theor. Comput. Sci..

[182]  Graham Cormode,et al.  What's hot and what's not: tracking most frequent items dynamically , 2003, TODS.

[183]  Graham Cormode,et al.  Space efficient mining of multigraph streams , 2005, PODS '05.

[184]  Graham Cormode,et al.  Holistic aggregates in a networked world: distributed tracking of approximate quantiles , 2005, SIGMOD '05.

[185]  Cecilia R. Aragon,et al.  Randomized search trees , 2005, Algorithmica.

[186]  Mario Szegedy,et al.  Near optimality of the priority sampling procedure , 2005, Electron. Colloquium Comput. Complex..

[187]  Sudipto Guha,et al.  Space Efficiency in Synopsis Construction Algorithms , 2005, VLDB.

[188]  Noga Alon,et al.  Estimating arbitrary subset sums with few probes , 2005, PODS '05.

[189]  A. Robert Calderbank,et al.  Improved range-summable random variable construction algorithms , 2005, SODA '05.

[190]  Theodore Johnson,et al.  Sampling algorithms in a stream operator , 2005, SIGMOD '05.

[191]  Christos Faloutsos,et al.  Fast estimation of fractal dimension and correlation integral on stream data , 2005, Inf. Process. Lett..

[192]  Divesh Srivastava,et al.  Streams, Security and Scalability , 2005, DBSec.

[193]  Divyakant Agrawal,et al.  Efficient Computation of Frequent and Top-k Elements in Data Streams , 2005, ICDT.

[194]  Csaba D. Tóth,et al.  Space complexity of hierarchical heavy hitters in multi-dimensional data streams , 2005, PODS '05.

[195]  Anna C. Gilbert,et al.  Improved time bounds for near-optimal sparse Fourier representations , 2005, SPIE Optics + Photonics.

[196]  David P. Woodruff,et al.  Optimal approximations of the frequency moments of data streams , 2005, STOC '05.

[197]  Graham Cormode,et al.  Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling , 2005, VLDB.

[198]  S. Muthukrishnan,et al.  Workload-Optimal Histograms on Streams , 2005, ESA.

[199]  Graham Cormode,et al.  Sketching Streams Through the Net: Distributed Approximate Query Tracking , 2005, VLDB.

[200]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[201]  Graham Cormode,et al.  Summarizing and Mining Skewed Data Streams , 2005, SDM.

[202]  Timothy M. Chan,et al.  Multi-Pass Geometric Algorithms , 2005, Discret. Comput. Geom..

[203]  Graham Cormode,et al.  An improved data stream summary: the count-min sketch and its applications , 2004, J. Algorithms.

[204]  Joan Feigenbaum,et al.  Graph distances in the streaming model: the value of space , 2005, SODA '05.

[205]  Carsten Lund,et al.  Learn more, sample less: control of volume and variance in network measurement , 2005, IEEE Transactions on Information Theory.

[206]  Joan Feigenbaum,et al.  On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..

[207]  Sudipto Guha,et al.  Wavelet synopsis for data streams: minimizing non-euclidean error , 2005, KDD '05.

[208]  Piotr Indyk,et al.  Sampling in dynamic data streams and applications , 2005, Int. J. Comput. Geom. Appl..

[209]  Christian Sohler,et al.  Coresets in dynamic geometric data streams , 2005, STOC '05.