Jump to content

Daniel Abadi

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by JCW-CleanerBot (talk | contribs) at 22:12, 4 July 2022 (→‎top: task, replaced: Sigact → SIGACT). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Daniel Abadi is the Darnell-Kanal Professor of Computer Science at University of Maryland, College Park[1] and was named an ACM Fellow in 2020.[2] His primary area of research is database systems. He is known for his contributions to distributed databases, column-store databases, deterministic databases, graph databases, and stream databases. Specifically, he developed the storage and query execution engines of the C-Store (column-oriented database) prototype, which was commercialized by Vertica and later acquired by Hewlett-Packard in 2011. His HadoopDB research on fault tolerant scalable analytical database systems was commercialized by Hadapt and acquired by Teradata in 2014.[citation needed]

Abadi was the first to describe the PACELC theorem in a 2010 blog post. PACELC, a response to the CAP theorem, was proved formally in 2018 in a SIGACT News article.[3]

Abadi currently is an advisor for FaunaDB.[4] Abadi was a recipient of the VLDB Test of Time Award for a 2009 publication titled HadoopDB: an architectural hybrid of MapReduce and DBMS technologies for analytical workloads.[5]

References

  1. ^ "Daniel Abadi named Darnell-Kanal Professor of Computer Science". www.cs.umd.edu. 2017-01-26. Retrieved 2021-04-12.
  2. ^ "2020 ACM Fellows Recognized for Work that Underpins Today's Computing Innovations". www.acm.org. Retrieved 2021-04-12.
  3. ^ Golab, Wojciech (2018). "Proving PACELC". ACM SIGACT News. 49: 73–81. doi:10.1145/3197406.3197420. S2CID 3989621.
  4. ^ "About Us". Fauna. Retrieved 2021-04-12.
  5. ^ "VLDB Test of Time Award". www.vldb.org. Retrieved 2021-04-12.