Papers:

• Approximate Frequency Counts over Data Streams
  Gurmeet Singh Manku, Rajeev Motwani
• Finding frequent items in data streams
  M. Charikar, K. Chen and M. Farach-Colton
• What?s Hot and What?s Not: Tracking Most Frequent Items Dynamically
  G. Cormode, M. Muthukrishnan
• Approximate Medians and other Quantiles in One Pass and with Limited Memory
  Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G. Lindsay
• Space-Efficient Online Computation of Quantile Summaries
  M. Greenwald, S. Khanna
• How to Summarize the Universe: Dynamic Maintenance of Quantiles
  Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin J. Strauss
• The space complexity of approximating the frequency moments
  Noga Alon, Yossi Matias, Mario Szegedy
• Stable distributions, pseudorandom generators, embeddings and data stream computation
  Piotr Indyk
• Maintaining Stream Statistics over Sliding Windows
  Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani
• Maintaining variance and k-medians over data stream windows
  B. Babcock, M. Datar, R. Motwani, L. O'Callaghan
• Size-estimation framework with applications to transitive closure and reachability
  Edith Cohen
  
• The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables
  Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld and Ayellet Tal
  

Surveys:

• Data streams: Algorithms and Applications
  M. Muthukrishnan
• Synopsis data structures for massive data sets
  P.B. Gibbons and Y. Matias
• Models and Issues in Data Stream Systems
  Babcock, Brian; Babu, Shivnath; Datar, Mayur; Motwani, Rajeev; Widom, Jennifer