Joseph M. Hellerstein

Professor

Research Areas

• Database Management Systems (DBMS)
• Operating Systems & Networking (OSNT)
• Security (SEC)

Research Centers

• Center for Intelligent Systems (CIS)

Teaching Schedule (Spring 2008)

• CS 262A. Advanced Topics in Computer Systems, T T 2:00-3:30P, 306 Soda
• CS 298-12. Database Seminar, F 12:30-2:00P, 606 Soda

Biography

Joseph M. Hellerstein is a Professor of Computer Science at the University of California, Berkeley. Hellerstein's research focuses on data management and networking, including database systems, sensor networks, declarative networking, peer-to-peer and distributed systems.

Hellerstein is an Alfred P. Sloan Research Fellow, and a recipient of multiple awards, including two ACM-SIGMOD "Test of Time" awards, VLDB Best Paper, IBM's Best Paper in Computer Science, NSF CAREER, NASA New Investigator, and an Okawa Foundation Fellowship. In 1999, MIT's Technology Review named him one of the top 100 young technology innovators worldwide in their inaugural "TR100" list.

In addition to his role in academia, Hellerstein has been a leader in the technology industry. From 2003-2005 he was Director of Intel Research, Berkeley, where he led research in networking and query processing for the Internet and for sensor networks. Hellerstein was a co-founder of Cohera Corporation (now part of Oracle), where he served as Chief Scientist from 1998-2001. Key ideas from his research have been incorporated into commercial and open-source database systems including IBM's DB2 and Informix, Oracle's PeopleSoft Catalog Management, and the open-source PostgreSQL system. He has also led a number of open-source systems projects at Berkeley, including TelegraphCQ, TinyDB, PIER and P2.

Hellerstein is the founding editor-in-chief of the journal Foundations and Trends in Databases. He currently serves on the Scientific Advisory Board (Fachbeirat) of the Max Planck Institute for Computer Science, as well as the technical advisory boards of a number of software and Internet companies. In the past he has served as a member of the advisory boards of ACM SIGMOD and Ars Digita University.

Hellerstein received his Ph.D. from the University of Wisconsin, a masters degree from UC Berkeley, and a bachelor's degree from Harvard. He spent a pre-doctoral internship at IBM Almaden Research Center, and a post-doctoral internship at the Hebrew University in Jerusalem.

Selected Publications

• R. J. Huebsch, M. Garofalakis, J. M. Hellerstein, and I. Stoica, "Sharing aggregate computation for distributed queries," in Proc. 2007 ACM SIGMOD Intl. Conf. on Management of Data (SIGMOD '07), C. Y. Chan, B. C. Ooi, and A. Zhou, Eds., Vol. 1, New York, NY: The Association for Computing Machinery, Inc., 2007, pp. 485-496.
• B. T. Loo, T. Condie, J. M. Hellerstein, P. Maniatis, T. Roscoe, and I. Stoica, "Implementing declarative overlays," ACM SIGOPS Operating Systems Review, vol. 39, no. 5, pp. 75-90, Dec. 2005.
• S. R. Madden, M. Franklin, J. M. Hellerstein, and W. Hong, "TinyDB: An acquisitional query processing system for sensor networks," ACM Trans. Database Systems: Special Issue: Best papers of SIGMOD/PODS 2003, vol. 30, no. 1, pp. 122-173, March 2005.
• S. R. Madden, M. Franklin, J. M. Hellerstein, and W. Hong, "The design of an acquisitional query processor for sensor networks," in Proc. 2003 ACM SIGMOD Intl. Conf. on Management of Data, New York, NY: ACM Press, 2003, pp. 491-502.
• S. R. Madden, M. Franklin, J. M. Hellerstein, and W. Hong, "TAG: A Tiny AGgregation service for ad hoc sensor networks," ACM SIGOPS Operating Systems Review, Berkeley, CA: USENIX Association, 2002, pp. 131-146.
• R. Avnur and J. M. Hellerstein, "Eddies: Continuously adaptive query processing," ACM SIGMOD Record, vol. 29, no. 2, pp. 261-272, June 2000.
• P. J. Haas and J. M. Hellerstein, "Best Paper in Computer Science, IBM Research: Ripple joins for online aggregation," ACM SIGMOD Record, vol. 28, no. 2, pp. 287-298, June 1999.
• J. M. Hellerstein, P. J. Haas, and H. J. Wang, "Winner, 2007 ACM SIGMOD Test of Time Award: Online aggregation," in Proc. 1997 ACM SIGMOD Intl. Conf. on Management of Data (SIGMOD '97), J. M. Peckman, S. Ram, and M. Franklin, Eds., New York, NY: The Association for Computing Machinery, Inc., 1997, pp. 171-182.
• J. M. Hellerstein, J. F. Naughton, and A. Pfeffer, "Generalized search trees for database systems," in Proc. 21st Intl. Conf. on Very Large Data Bases, U. Dayal, P. M. D. Gray, and S. Nishio, Eds., San Francisco, CA: Morgan Kaufmann, 1995, pp. 562-573.
• H. Pirahesh, J. M. Hellerstein, and W. Hasan, "Winner, 2002 ACM SIGMOD Test of Time Award: Extensible/rule-based Query Rewrite optimization in Starburst," in Proc. 1992 ACM SIGMOD Intl. Conf. on Management of Data (SIGMOD '92), M. Stonebraker, Ed., New York, NY: The Association for Computing Machinery, Inc., 1992, pp. 39-48.