Phil Bernstein

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Phil Bernstein is a computer scientist specializing in database research in the Database Group of Microsoft Research. Bernstein is also an affiliate professor at the University of Washington and frequent committee member or chair of conferences such as VLDB and SIGMOD. He won the SIGMOD Edgar F. Codd Innovations Award in 1994,[1] and in 2011 with Jayant Madhavan and Erhard Rahm the VLDB 10 Year Best Paper Award for their VLDB 2001 paper "Generic Schema Matching with Cupid".[2]

Bernstein is a member of the National Academy of Engineering (elected 2003)[3] and an elected Fellow of the Association for Computing Machinery.[4]

He is a co-Editor-in-Chief of the International Journal on Very Large Data Bases.[5] and a member of the National Academies Board on Mathematical Sciences and their Applications.[6]

References[edit]

  1. ^ 1994 SIGMOD Edgar F. Codd Innovations Award
  2. ^ VLDB 2011 Detailed Program
  3. ^ Bernstein, Smith Elected to NAE, Department of Computer Science and Engineering, University of Washington. Accessed June 10, 2011
  4. ^ ACM Fellows, Association for Computing Machinery. Accessed June 2011. Election citation: "For pioneering work in distributed query optimization, distributed databases, distributed transaction processing, metadata management, and schema integration."
  5. ^ Editorial Board, International Journal on Very Large Data Bases, Springer-Verlag. Accessde June 10, 2011
  6. ^ Member Bios, Board on Mathematical Sciences and their Applications, United States National Academies. Accessed June 10, 2011

External links[edit]