Thomas Neumann

Thomas Neumann (born 1977[3]) is a German computer scientist and full professor for Data Science and Engineering at the Technical University of Munich (

Thomas Neumann
Thomas Neumann
Neumann in 2023
Born1977 (age 48–49)[3]
Alma materUniversity of Mannheim[1]
Known forRDF-3X
in-memory databases
AwardsLeibniz Prize[1]
Scientific career
FieldsComputer science
InstitutionsTechnical University of Munich
Saarland University
Thesis Efficient generation and execution of DAG-structured query graphs[2]  (2005)
Guido Moerkotte

Thomas Neumann (born 1977[3]) is a German computer scientist and full professor for Data Science and Engineering at the Technical University of Munich (TUM).[4]

Education and career

Thomas Neumann finished his studies in business informatics, at the University of Mannheim in 2001.[1] He received his doctor's degree in computer science under the supervision of Guido Moerkotte, in 2005,[2] and then worked as a senior researcher at the Max Planck Institute for Computer Science in Saarbrücken, with Gerhard Weikum. During this time, Neumann developed RDF-3X,[5] a system for graph databases. He habilitated in 2010 at Saarland University.[3] In the same year, he joined the group for database systems at TUM under Alfons Kemper as associate professor.[3] In 2017, he became a full professor for Data Science and Engineering, also at TUM.[1]

Research

His research areas are query optimisation and efficient query processing by just-in-time compilation.[6] As part of this research, he developed the main memory database system HyPer, which was sold to Tableau Software in 2016,[7] and its successor system Umbra.[8] He was awarded the Gottfried Wilhelm Leibniz Prize by the German Research Foundation for his work on HyPer.[1]

Awards

References

  1. ^ a b c d e f "Prof. Dr. Thomas Neumann – Gottfried Wilhelm Leibniz Prize Winner 2020". Retrieved 2022-10-08.
  2. ^ a b "Efficient Generation and Execution of DAG-Structured Query Graphs". 25 July 2005. Retrieved 2022-08-22.
  3. ^ a b c d "TUM Professoren – Neumann_Thomas". Retrieved 2022-03-06.
  4. ^ "Chairs". Retrieved 2022-10-08.
  5. ^ "RDF-3X – Fast Searches for Semantic Data". Retrieved 2022-03-23.
  6. ^ Neumann, Thomas (2011). "Efficiently Compiling Efficient Query Plans for Modern Hardware". Proceedings of the VLDB Endowment. 4 (9): 539–550. CiteSeerX 10.1.1.230.8553. doi:10.14778/2002938.2002940. S2CID 10388381. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
  7. ^ "Tableau Acquires HyPer". Retrieved 2022-03-23.
  8. ^ "Umbra: Team". Retrieved 2022-10-08.
  9. ^ "VLDB 2025 Endowment Awards".
  10. ^ "VLDB 2025 Awards".
  11. ^ "2021 VLDB Endowment Awards". Retrieved 2022-03-23.
  12. ^ "ICDE Influential Paper Awards". Retrieved 2022-03-23.
  13. ^ "Ten times highly endowed EU funding". 20 April 2016. Retrieved 2022-03-06.
  14. ^ "VLDB 2014 – Awards". Retrieved 2022-03-06.
  15. ^ "IOI 1994: Results". Retrieved 2023-10-02.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.