Val Tannen | |
|---|---|
 | |
| Born | 1953 (age 70–71) Romania |
| Alma mater | MIT |
| Awards |
|
| Scientific career | |
| Fields | Computer Science |
| Institutions | University of Pennsylvania |
| Doctoral advisor | Albert Meyer |
| Doctoral students | Dan Suciu |
| Website | https://www.cis.upenn.edu/~val/home.html |
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.
Tannen was born in Romania and received his undergraduate degree from the Polytechnic Institute of Bucharest. After emigrating to the US, he received his PhD from Massachusetts Institute of Technology under the supervision of Albert Meyer. He has held numerous international visiting positions. [1]
Tannen has contributed to the principles of both programming languages and databases and also to the unification of the two subjects. One of Tannen’s major contributions is the use of structural recursion to define a query language for nested relations. This not only provided a basis for query optimization on nested relations, it became – through the use of comprehensions – a standard technique for embedding relational databases in programming languages. [2] Another is the invention of provenance semirings which give a generalization of many adjuncts to relational databases, such as probabilistic databases, C-tables and bag semantics as well as providing a general formalism for data provenance. [3] In addition to databases and programming languages, Tannen has contributed to bioinformatics and to systematic and evolutionary biology. [4]
On May 24 and 25 2024 a festschrift was held in Val Tannen's honor at the University of Pennsylvania. [5]
Paris Christos Kanellakis was a Greek American computer scientist.
Mihalis Yannakakis is professor of computer science at Columbia University. He is noted for his work in computational complexity, databases, and other related fields. He won the Donald E. Knuth Prize in 2005.
Ronald Fagin is an American mathematician and computer scientist, and IBM Fellow at the IBM Almaden Research Center. He is known for his work in database theory, finite model theory, and reasoning about knowledge.
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.
Alberto O. Mendelzon was an Argentine-Canadian computer scientist who died on June 16, 2005.
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).
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.
Tomasz Imieliński is a Polish-American computer scientist, most known in the areas of data mining, mobile computing, data extraction, and search engine technology. He is currently a professor of computer science at Rutgers University in New Jersey, United States.
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.
Emmerich (Emo) Welzl is a computer scientist known for his research in computational geometry. He is a professor in the Institute for Theoretical Computer Science at ETH Zurich in Switzerland.
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.
An uncertain database is a kind of database studied in database theory. The goal of uncertain databases is to manage information on which there is some uncertainty. Uncertain databases make it possible to explicitly represent and manage uncertainty on the data, usually in a succinct way.
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.
Leonid Libkin is a computer scientist who works in data management, in particular in database theory, and in logic in computer science.
In database theory, Imieliński–Lipski algebra is an extension of relational algebra onto tables with different types of null values. It is used to operate on relations with incomplete information.
Witold Lipski Jr. was a Polish computer scientist, and an author of two books: Combinatorics for Programmers and (jointly with Wiktor Marek Combinatorial analysis. Lipski, jointly with his PhD student, Tomasz Imieliński, created foundations of the theory of incomplete information in relational databases.
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.