- Sep 2017 -- present: VP Research at relational
__AI__. - June 2015 -- Aug 2017: Computer Scientist at LogicBlox.
- 2001-2017: (Assistant → Associate → Full) Professor of Computer Science and Engineering, State University of New York at Buffalo.
- Education:
- Ph.D. in Computer Science and Engineering,
- M.S. in Mathematics,

-- both from University of Minnesota, Twin Cities, 2001. - B.S. 1995, Computer Engineering, Ho Chi Minh city University of Technology, Vietnam.

Recent TPC memberships:

- TPC member: ICDT 2017, PODS 2018, 2019, 2020
- TPC member: VLDB 2021, ICDT 2022
- TPC Chair: PODS 2023

Put `dot`

s and
`@`

in between a permutation of the the following words:
`ai`

`hung`

`relational`

`ngo`

Curriculum Vitae, often not up to date

Current research interest: algorithms for (in-)database computation.

- "
*Answering (Functional Aggregate) Queries via Tensor Decomposition*", Northeastern Data Lab Seminar, Summer-Fall 2020. - "
*Relational optimization*", Emerging challenges in databases and AI research. Invited talk. - "
*Machine Learning on Relational Data: a Different Take*", John Postel Distinguished Lecture Series, Computer Science Department, UCLA, Nov 06th, 2018. [ video ] - "
*Worst-case optimal join algorithms: techniques, results, and open problems"*", Gems of PODS talk at PODS 2018, keynote at AMW 2018, lunch seminar at UC Berkeley, GraphDB group at LinkedIn. [ video ] [slides in pptx] - "
*Shannon-type inequalities, submodular width, and disjunctive datalog*", keynote at HIGHLIGHTS 2017: Highlights of Logic, Games, & Automata. [slides] - "
*Functional Aggregate Queries are FAQs*", seminar talk at Univ. of Wisconsin, UCSD, Oxford Univ., Univ. of Washington, Stanford. [slides]

- Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, and Yisu Remy
Wang. "
*Convergence of Datalog over (Pre-) Semirings*", PODS 2022. [ArXiV version] - Mahmoud Abo Khamis, Ryan Curtin, Sungjin Im, Ben Moseley,, Hung Q. Ngo, Kirk Pruhs and Alireza
Samadian, "
*An Approximation Algorithm for the Matrix Tree Multiplication Problem*", Mathematical Foundations of Computer Science (MFCS 2021) [pdf] - Ahmet Kara, Hung Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang.
"
*Maintaining Triangle Queries under Updates*", ACM Transactions on Database Systems (TODS). [ArXiV version] -
Shikha Singh, Sergey Madaminov, Michael Bender, Michael Ferdman, Ryan Johnson,
Benjamin Moseley, Hung Ngo, Dung Nguyen, Soeren Olesen, Kurt Stirewalt,
and Geoffrey Washburn,
"
*A Scheduling Approach to Incremental Maintenance of Datalog Programs*", IPDPS 2020. - Mahmoud Abo Khamis, Phokion Kolaitis,, Hung Q. Ngo, Dan Suciu
"
*Decision Problems in Information Theory*", ICALP 2020, [ArXiV version] - Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong
Nguyen, Dan Olteanu, and Maximilian Schleich.
"
*Rk-means: fast clustering for relational data*", AISTATS 2020, [ArXiV version] - Mahmoud Abo Khamis, Phokion Kolaitis, Hung Q. Ngo, and Dan Suciu
"
*Bag Query Containment and Information Theory*", PODS 2020. [ArXiV version] - M. Schleich, D. Olteanu, M. A. Khamis, H. Q. Ngo, and X. Nguyen.
"
*A layered aggregate engine for analytics workloads*", SIGMOD 2019. - Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, and Maximilian Schleich.
"
*Learning Models over Relational Data using Sparse Tensors and Functional Dependencies*". [ArXiV version] (superset of the AC/DC paper and PODS 2018 paper) - Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong
Nguyen, Dan Olteanu, and Maximilian Schleich.
"
*"On Functional Aggregate Queries with Additive Inequalities"*", PODS 2019. [ArXiV version] - Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, and Dan Suciu.
"
*Boolean Tensor Decomposition for Conjunctive Queries with Negation*", ICDT 2019. [ArXiV version] - Best paper award
Ahmet Kara, Hung Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang.
"
*Counting Triangles under Updates in Worst-Case Optimal Time*", ICDT 2019. [ArXiV version] [Journal (ArXiV) version] - Hung Q. Ngo,
"
*Worst-case Optimal Join Algorithms: Techniques, Results, and Open Problems*", PODS 2018. Invited [ArXiV version] - Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, and Maximilian Schleich.
"
*AC/DC: In-Database Learning Thunderstruck*". [ArXiV version] - Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, and Maximilian Schleich.
"
*In-Database Learning with Sparse Tensors*". PODS 2018. [ArXiV version] - Vishrawas Gopalakrishnan, Kishlay Jha, Guangxu Xun, Hung Q. Ngo,
and Aidong Zhang, "
*Towards Self-learning Based Hypotheses Generation in Biomedical Text Domain*", Bioinformatics 34(12), pp. 2003--2015 (2018), Oxford University Press. [ pdf ] - Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, and Maximilian Schleich.
"
*In-Database Factorized Learning*". In Alberto Mendelzon Workshop (AMW), Montevideo, June 2017. [pdf] - Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu,
"
*What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another?*", PODS 2017. [ArXiV version] [Short slides] [Longer slides] Invited to Journal of the ACM - Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra,
"
*Juggling functions inside a database*", SIGMOD Records, SIGMOD Research Highlights, 2017. [ArXiV version] - Devansh Arpit, Yingbo Zhou, Hung Q. Ngo, Venu Govindaraju,
"
*Why Regularized Auto-Encoders learn Sparse Representation?*", ICML 2016. [ArXiV version] - Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu,
"
*Computing Join Queries with Functional Dependencies*", PODS 2016. [ArXiV version] Invited to Theory Fest at STOC 2018 - Best paper award
Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra,
"
*FAQ: Questions Asked Frequently*", PODS 2016. [ArXiV version] [Talk slides] 2016 ACM SIGMOD Research Highlight Award Invited to Journal of the ACM Invited to Theory Fest at STOC 2017

"Sometimes it happens that a man's circle of horizon becomes smaller and smaller, and as the radius approaches zero it concentrates on one point. And then that becomes his point of view."

David Hilbert

"Hỏi rằng người ở quê đâu

Thưa rằng tôi ở rất lâu quê nhà"

Bùi Giáng

"Beauty is the first test: there is no permanent place in the world for ugly Mathematics."

*A Mathematician's Apology* (London 1941).

Godfrey Harold Hardy

"We can only see a short distance ahead, but we can see plenty there that needs to be done."

*Computing Machinery and Intelligence* (1950). (The paper)

Alan Turing