Guest Editorial to the special issue on data stream processing

Guest Editorial to the special issue on data stream processing The VLDB Journal (2004) 13: 317 / Digital Object Identifier (DOI) 10.1007/s00778-004-0141-5 1 2,3 Johannes Gehrke , Joseph M. Hellerstein Department of Computer Science, Cornell University; Ithaca, NY 14853, USA; e-mail: Computer Science Division, University of California, Berkeley; Berkeley, CA 94720, USA; e-mail: Intel Research, Berkeley; Berkeley, CA; 94704, USA Published online: November 12, 2004 – c Springer-Verlag 2004 Data stream management techniques have been a hot research The fourth paper is an experience paper. It describes the area in the database community for the last 5 years. To our latest lessons from the design and implementation of the Au- call for papers for this special issue with a deadline of October rora stream processing engine, and it describes the authors’ 2003 we received 23 submissions that covered a wide range vision for their next system. of ongoing data stream research. In two rounds of review, The issue concludes with an article on data stream pro- we selected five papers that represent the diversity and depth cessing in sensor networks. Sensor nodes are different from of this research. Early work in data streams concentrated on traditional computers since energy is one of the limiting fac- developing efficient algorithms for specific data stream queries tors. The authors propose two methods for saving energy. First, such as sampling, join size estimation, and quantiles. This they propose a group-aware network construction that mini- issue shows that current data stream research has matured and mizes network traffic. Second, they allow queries to specify transcended pure algorithmic research to novel data types such that approximate query results (within user-specified bounds) as XML and to core systems issues. are sufficient, a further opportunity to reduce traffic. The stream considered in the first paper consists of XML Overall, we believe that these papers are an excellent snap- user queries rather than traditional data records. The paper shot of the state of the data stream community as of early 2004, considers how to efficiently mine frequent XML query pat- and we hope that you will enjoy reading the papers as much terns. As it is not feasible to keep all queries in main memory, as we did. the authors give efficient algorithms to incrementally maintain frequent user queries. Acknowledgements. We would like to thank Tamer Ozsu, our editor- The second paper considers how a data stream manage- in-chief, for his advice and support throughout the process, and we ment system can deal with load spikes by carefully scheduling would like to thank Stacey Shirk for administrative support. Our operators in the system. The suggested scheduling method, biggest thanks go to the authors whose contributions created the issue chain scheduling, keeps the output latency within a given that you are reading. bound while minimizing queuing memory. The third paper shows how to give approximate answers to aggregate queries over datasets undergoing constant change. In particular, this paper focuses on dealing with a stream that includes not only insertions of new data but also deletions of Johannes Gehrke old data. Joseph M. Hellerstein The VLDB Journal Springer Journals

Guest Editorial to the special issue on data stream processing

1 page

Loading next page...
1 Page
Copyright © 2004 by Springer-Verlag
Computer Science; Database Management
Publisher site
See Article on Publisher Site

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.

DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches


Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.



billed annually
Start Free Trial

14-day Free Trial