Héctor García-Molina

from Wikipedia, the free encyclopedia

Héctor García-Molina (born November 26, 1953 in Monterrey , Mexico , † November 25, 2019 at Stanford , California ) was a Mexican-born American computer scientist and professor at Stanford University . He dealt with databases, searches in computer networks and digital libraries.

Garcia-Molina studied electrical engineering at the Instituto Tecnológico y de Estudios Superiores de Monterrey (ITESM) with a bachelor's degree in 1974 and at Stanford University with a master's degree in 1975 and a doctorate in computer science in 1979 with Gio Wiederholt ( Performance of Update Algorithms for Replicated Data in a Distributed Database ). From 1979 he was at Princeton University , where he became a professor of computer science, before becoming professor at Stanford in 1992, where he is Leonard Bosack and Sandra Lerner professor , was director of the Computer Systems Laboratory from 1994 to 1997 and of computer science from 2001 to 2004 -Faculty Board.

From 1994 to 1998 he was chief scientist at the Stanford Digital Library Project , which was also responsible for the basic research of the Google search engine. From 1997 to 2001 he was on the US President's Advisory Committee on Information Technology. From 2001 he was on the board of directors of Oracle .

He was a Fellow of the Association for Computing Machinery , the American Academy of Arts and Sciences, and the National Academy of Engineering . In 1999 he received the ACM Sigmod Innovation Award. In 2007 he received an honorary doctorate from the ETH Zurich .

Fonts

  • with Jeffrey D. Ullman , Jennifer D. Widom: Database System Implementation, Pearson 1999
  • with Jeffrey D. Ullman, Jennifer D. Widom: Database Systems: The Complete Book, Prentice Hall 2001, Pearson 2002
  • with Junghoo Cho: The Evolution of the Web and Implications for an Incremental Crawler, International Conference on Large Data Bases, Cairo 2000, pp. 200-209
  • with Kenneth Salem: Disk Striping, IEEE ICDE, Los Angeles, 1986, pp. 336-342
  • with K. Salem: Sagas, ACM Sigmod Record, 16, 1987, pp. 249-259
  • with S. Chawathe, J. Hammer, K. Ireland, Yannis Papakonstantinou, Jeffrey Ullman, Jennifer Widom: The TSIMMIS project: Integration of heterogeneous information sources, 2002
  • with Yannis Papakonstantinou, Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jeffrey Ullman, Vasilis Vassalos, Jennifer Widom: The TSIMMIS approach to mediation: Data models and languages, Journal of Intelligent Information Systems, 8, 1997, 117-132
  • with B. Yang: Improving Search in Peer-to-Peer Networks, Proc. 22nd Int. Conf. Distributed Systems Computing, 2002, 5-14
  • with B. Yang: Designing a Super-Peer Network, Proc. 19th Int. Conf. Data Engineering, 2003, pp. 49-60
  • with Larry Page , J. Cho: Effective crawling through URL ordering, Computer Networks and ISDN Systems, 30, 1998, 161-172
  • with SD Kamvar, MT Schlosser: The eigentrust algorithm for reputation management in p2p networks, Proc. 12th Int. Conf. WWW, 2003, 640-651
  • with Sergey Melnik, Erhard Rahm: Similarity flooding: A versatile graph matching algorithm and its application to schema matching, Proc. 18th Int. Conf. Data Engineering, 2002, pp. 117-128
  • with O. Brandman, J. Cho, Narayanan Shivakumar: Crawler-friendly web servers, Proceedings of ACM SIGMETRICS Performance Evaluation Review, Volume 28, Issue 2, 2000 ( Sitemaps protocol )
  • with Zoltán Gyöngyi, Jan Pedersen, Combating Web Spam with TrustRank , Proceedings of the International Conference on Very Large Data Bases, Volume 30, 2004, 576 ( TrustRank )

Web links

Individual evidence

  1. Héctor García-Molina in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used