 | This article needs additional citations for verification .(February 2024) |
Alberto O. Mendelzon | |
|---|---|
| Born | July 28, 1951 |
| Died | June 16, 2005 (aged 53) |
| Alma mater | Princeton University |
| Known for | Chase Web query languages Answering queries using views |
| Awards | Member of the Royal Society of Canada |
| Scientific career | |
| Fields | Computer Science |
| Institutions | University of Toronto |
| Doctoral advisor | Jeffrey Ullman |
Alberto O. Mendelzon was an Argentine-Canadian computer scientist who died on June 16, 2005.
Alberto Mendelzon was born in Buenos Aires, Argentina. He graduated from the University of Buenos Aires in 1973. He then received a Ph.D. degree from Princeton University in 1979, where his advisor was Jeffrey Ullman. After that he was a post-doctoral fellow at the IBM T.J. Watson Research Center for a year before joining the faculty of the University of Toronto in 1980.
He was one of the pioneers who helped to lay the foundations of relational databases. His early work on database dependencies has been influential in both the theory and practice of data management. He has made fundamental contributions in the areas of graphical query languages, knowledge-base systems, and on-line analytic processing. His work has provided the foundation for languages used to query the structure of the web.
Mendelzon established some of the earliest results on using the relational data model. Together with his thesis advisor, Jeffrey Ullman, and fellow Princeton students, including David Maier and Yehoshua Sagiv, he co-authored a number of influential papers that laid out the fundamental issues and approaches for relational databases. In a now-famous paper (Maier, Mendelzon and Sagiv, TODS 1979), he introduced the chase, a method for testing implication of data dependencies that is now of widespread use in the database theory literature. This work has been highly influential: it is used, directly or indirectly, on an everyday basis by people who design databases, and it is used in commercial systems to reason about the consistency and correctness of a data design. New applications of the chase in meta-data management and data exchange are still being discovered.
In the 1980s, Mendelzon began an important line of work on graphical query languages. His work has been called prescient as it began before the World Wide Web, and nonetheless established many of the scientific principles required for designing languages to query the Web.
More recently, Mendelzon was a central figure in the work on view-based querying. Starting with the innovative LMSS95 paper (Levy, Mendelzon, Sagiv, and Srivastava, PODS 1995) that introduced the problem of answering queries using views, Alberto Mendelzon made several important contributions to the emerging area of view-based modeling and processing.
His research was central to the development of many areas of database research such as database design, semantic query optimization, graphical query languages, and querying web data. In addition, he also made important contributions to recursive query languages, on-line analytic processing, similarity-based queries, data warehouses and view maintenance, algorithms for computing web page reputations, and indexing of XML data.
Mendelzon was an active member of both the database theory and database systems research communities. He served as the PC Chair for ACM PODS in 1991 and as General Chair in both 1997 and 1998. He served as PC Chair for VLDB in 1992, and as a member of the SIGMOD Executive Committee from 1998 to 2001. He was a member of the Royal Society of Canada.
The ACM PODS Alberto O. Mendelzon Test-of-Time Award was established in 2007 and was awarded for the first time in 2008. It is awarded every year to a paper or a small number of papers published in the PODS proceedings ten years prior that had the most impact in terms of research, methodology, or transfer to practice over the intervening decade. [1]
Since 2006, the Alberto Mendelzon International Workshop on Foundation of Databases and the Web (AMW) brings together top researchers from all over the world, creating the opportunity to discuss and spread research results.
| Workshop | Date | Place | Proceedings |
|---|---|---|---|
| AMW 2024 | September 30—October 4, 2024 |  Mexico City, Mexico | |
| AMW 2023 | May 22–26, 2023 |  Santiago, Chile | |
| AMW 2021 | September 22–23, 2021 | Virtual | |
| AMW 2019 | June 3–7, 2019 |  Asunción, Paraguay | CEUR Vol-2369 |
| AMW 2018 | May 21–25, 2018 |  Cali, Colombia | CEUR Vol-2100 |
| AMW 2017 | June 5–9, 2017 |  Montevideo, Uruguay | CEUR Vol-1912 |
| AMW 2016 | June 6–10, 2016 |  Panama City, Panama | CEUR Vol-1644 |
| AMW 2015 | May 6–8, 2015 |  Lima, Peru | CEUR Vol-1378 |
| AMW 2014 | June 2–6, 2014 | Cartagena, Colombia | CEUR Vol-1189 |
| AMW 2013 | May 21–23, 2013 | Puebla, Mexico | CEUR Vol-1087 |
| AMW 2012 | June 27–30, 2012 |  Ouro Preto, Brazil | CEUR Vol-866 |
| AMW 2011 | May 9–12, 2011 | Santiago, Chile | CEUR Vol-749 |
| AMW 2010 | May 17–20, 2010 |  Buenos Aires, Argentina | CEUR Vol-619 |
| AMW 2009 | May 12–15, 2009 | Arequipa, Peru | CEUR Vol-450 |
| AMW 2007 | October 23–26, 2007 | Punta del Este, Uruguay | |
| AMW 2006 | November 2006 | Laguna San Rafael National Park, Chile |
Database theory encapsulates a broad range of topics related to the study and research of the theoretical realm of databases and database management systems.
Seymour Ginsburg was an American pioneer of automata theory, formal language theory, and database theory, in particular; and computer science, in general. His work was influential in distinguishing theoretical Computer Science from the disciplines of Mathematics and Electrical Engineering.
Raymond Francis Boyce (1946–1974) was an American computer scientist known for his research in relational databases. He is best known for his work co-developing the SQL database language and the Boyce-Codd normal form.
Serge Joseph Abiteboul is a French computer scientist working in the areas of data management, database theory, and finite model theory.
Oscar Peter Buneman is a British computer scientist who works in the areas of database systems and database theory.
Dan Suciu is a full professor of computer science at the University of Washington. He received his Ph.D. from the University of Pennsylvania in 1995 under the supervision of Val Tannen. After graduation, he was a principal member of the technical staff at AT&T Labs until he joined the University of Washington in 2000. Suciu does research in data management, with an emphasis on Web data management and managing uncertain data. He is a co-author of an influential book on managing semistructured data.
David Maier is the Maseeh Professor of Emerging Technologies in the Department of Computer Science at Portland State University. Born in Eugene, OR, he has also been a computer science faculty member at the State University of New York at Stony Brook (1978–82), Oregon Graduate Center, University of Wisconsin, Oregon Health & Science University (2001–present) and National University of Singapore (2012–15). He holds a B.A. in Mathematics and Computer Science from the University of Oregon and a Ph.D. in Electrical Engineering and Computer Science from Princeton University (1978).
The chase is a simple fixed-point algorithm testing and enforcing implication of data dependencies in database systems. It plays important roles in database theory as well as in practice. It is used, directly or indirectly, on an everyday basis by people who design databases, and it is used in commercial systems to reason about the consistency and correctness of a data design. New applications of the chase in meta-data management and data exchange are still being discovered.
Yehoshua Chaim ("Shuky") Sagiv is a computer scientist and professor of computer science at the Hebrew University of Jerusalem. He obtained his PhD at Princeton University in 1978. His advisor was Jeffrey Ullman.
Alon Yitzchack Halevy is an Israeli-American computer scientist and a researcher in the area of data integration. He was a research scientist at Google from 2005 to 2015, when he left to become head of Recruit Institute of Technology. He left Recruit in 2018 and joined Facebook AI in 2019. Until 2006, he was a professor of computer science at the University of Washington, where his doctoral students included Xin Luna Dong. He received his PhD from Stanford University in 1993, under the joint supervision of Richard Fikes and Edward Feigenbaum.
Victor Vianu is a computer scientist, a professor of computer science and engineering at the University of California, San Diego. He served as editor-in-chief of the Journal of the ACM from 2009 to 2015.
Tova Milo is a full Professor of Computer Science at Tel Aviv University and the Dean of the Faculty of Exact Sciences. She served as the head of the Computer Science Department from 2011 to 2014. Milo is the head of the data management group in Tel Aviv University, and her research focuses on Web data management. She received her PhD from the Hebrew University in 1992 under the supervision of Catriel Beeri, and was a postdoctoral fellow at the University of Toronto and INRIA, France, prior to joining Tel Aviv University.
Martin L. Kersten was a computer scientist with research focus on database architectures, query optimization and their use in scientific databases. He was an architect of the MonetDB system, an open-source column store for data warehouses, online analytical processing (OLAP) and geographic information systems (GIS). He has been (co-) founder of several successful spin-offs of the Centrum Wiskunde & Informatica (CWI).
In relational database theory, a tuple-generating dependency (TGD) is a certain kind of constraint on a relational database. It is a subclass of the class of embedded dependencies (EDs).
Wenfei Fan is a Chinese-British computer scientist and professor of web data management at the University of Edinburgh. His research investigates database theory and database systems.
TypeDB is an open-source, distributed database management system that relies on a user-defined type system to model, manage, and query data.
A reconstruction attack is any method for partially reconstructing a private dataset from public aggregate information. Typically, the dataset contains sensitive information about individuals, whose privacy needs to be protected. The attacker has no or only partial access to the dataset, but has access to public aggregate statistics about the datasets, which could be exact or distorted, for example by adding noise. If the public statistics are not sufficiently distorted, the attacker is able to accurately reconstruct a large portion of the original private data. Reconstruction attacks are relevant to the analysis of private data, as they show that, in order to preserve even a very weak notion of individual privacy, any published statistics need to be sufficiently distorted. This phenomenon was called the Fundamental Law of Information Recovery by Dwork and Roth, and formulated as "overly accurate answers to too many questions will destroy privacy in a spectacular way."
Phokion G. KolaitisACM is a computer scientist who is currently a Distinguished Research Professor at UC Santa Cruz and a Principal Research Staff Member at the IBM Almaden Research Center. His research interests include principles of database systems, logic in computer science, and computational complexity.
Nicola Leone is an Italian computer scientist who works in the areas of artificial intelligence, knowledge representation and reasoning, and database theory. Leone is currently the rector of the University of Calabria and a professor of Computer Science. Previously, he was a professor of Database Systems at the TU Wien.
Val Tannen is a computer scientist known for his contributions to the fields of database systems and programming languages. He is currently professor in the Department of Computer and Information Science at the University of Pennsylvania.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
