Victor Vianu

Last updated
Victor Vianu
Alma mater University of Southern California
Known for Abiteboul–Vianu theorem
Scientific career
Doctoral advisor Seymour Ginsburg

Victor Vianu is a computer scientist, a professor of computer science and engineering at the University of California, San Diego. [1] He served as editor-in-chief of the Journal of the ACM from 2009 to 2015. [2] [3]

Vianu did his graduate studies at the University of Southern California, earning his Ph.D. in 1983 under the supervision of Seymour Ginsburg; he joined the UCSD faculty in 1984. [1]

Vianu's book Foundations of Databases (with Serge Abiteboul and Richard Hull, Addison-Wesley, 1995) is a standard graduate textbook in database theory. In finite model theory and computational complexity theory, the Abiteboul–Vianu theorem (also published with Abiteboul, at the 1991 Symposium on Theory of Computing) states that polynomial time equals PSPACE if and only if fixed-point logic equals partial fixed-point logic. At the 2010 Symposium on Principles of Database Systems, Vianu and his co-authors Dan Suciu and Tova Milo won the Alberto O. Mendelzon Test-of-Time Award for their work ten years prior on type checking for XML transformation languages. [4] Vianu and his co-author Luc Segoufin won a second Alberto O. Mendelzon Test-of-Time award in 2015, for their 2005 article "Views and Queries: Determinacy and Rewriting."

In 2006, Vianu was elected as a Fellow of the ACM for his "contributions to database management systems". [5]

In 2013, he was elected Fellow of the AAAS (American Association for the Advancement of Science). He was elected to Academia Europaea in 2014.

In his first paper recorded by DBLP [6] (presented at MFCS, 1977), Vianu acknowledges Solomon Marcus for guidance. [7]

Related Research Articles

Database theory encapsulates a broad range of topics related to the study and research of the theoretical realm of databases and database management systems.

Descriptive complexity is a branch of computational complexity theory and of finite model theory that characterizes complexity classes by the type of logic needed to express the languages in them. For example, PH, the union of all complexity classes in the polynomial hierarchy, is precisely the class of languages expressible by statements of second-order logic. This connection between complexity and the logic of finite structures allows results to be transferred easily from one area to the other, facilitating new proof methods and providing additional evidence that the main complexity classes are somehow "natural" and not tied to the specific abstract machines used to define them.

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.

<span class="mw-page-title-main">Mihalis Yannakakis</span> 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.

<span class="mw-page-title-main">Ronald Fagin</span> American mathematician and computer scientist

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.

Codd's theorem states that relational algebra and the domain-independent relational calculus queries, two well-known foundational query languages for the relational model, are precisely equivalent in expressive power. That is, a database query can be formulated in one language if and only if it can be expressed in the other.

<span class="mw-page-title-main">Serge Abiteboul</span> French computer scientist

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.

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).

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.

<span class="mw-page-title-main">Tova Milo</span> Israeli computer scientist

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.

In relational database theory, an equality-generating dependency (EGD) is a certain kind of constraint on data. It is a subclass of the class of embedded dependencies (ED).

<span class="mw-page-title-main">Wenfei Fan</span> Chinese-British computer scientist

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.

Kobbi Nissim is a computer scientist at Georgetown University, where he is the McDevitt Chair of Computer Science. His areas of research include cryptography and data privacy. He is known for the introduction of differential privacy.

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.

<span class="mw-page-title-main">Nicola Leone</span> Italian computer scientist

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.

References

  1. 1 2 Faculty profile, UCSD, retrieved 2011-03-21.
  2. Vianu, Victor (2010). "JACM at the Start of a New Decade". Journal of the ACM . 57 (3). doi: 10.1145/1706591.1706592 .
  3. "History | Journal of the ACM". jacm.acm.org. Archived from the original on 2011-10-26. Retrieved 2015-08-12.
  4. ACM PODS Alberto O. Mendelzon Test-of-Time Award, ACM SIGMOD, retrieved 2011-03-21.
  5. Award citation, ACM Fellow, ACM, retrieved 2011-03-21.
  6. "DBLP: Victor Vianu".
  7. Vianu, Victor (1977). "Mathematical Foundations of Computer Science 1977". In Gruska, Jozef (ed.). Proceedings, 6th Symposium, Mathematical Foundations of Computer Science, Tatranská Lomnica, September 5–9, 1977. Lecture Notes in Computer Science. Vol. 53. Springer-Verlag. pp. 537–542. doi:10.1007/3-540-08353-7_177. ISBN   978-3-540-08353-5.