Professional Information

Recent TPC memberships:

  • TPC member: ICDT 2017, PODS 2018, 2019, 2020
  • TPC member: VLDB 2021, ICDT 2022
  • TPC Chair: PODS 2023
  • Co-organizer: Logic and Algorithms, Simons Program 2023

Put dots and @ in between a permutation of the the following words: ai hung relational ngo

Curriculum Vitae, often not up to date

Current research interests: query optimization, declarative computation.

Selected talks

Selected or Recent Papers

  • Mahmoud Abo Khamis, Hung Q. Ngo, Dan Suciu "PANDA: Query Evaluation in Submodular Width", [ArXiV version]
  • Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, "On the Convergence Rate of Linear Datalogo over Stable Semirings", ICDT 2024. [ArXiV version]
  • Amir Shaikhha, Dan Suciu, Maximilian Schleich, Hung Q. Ngo, "Optimizing Nested Recursive Queries", SIGMOD 2024. [pdf]
  • Hung Q. Ngo, "On an Information Theoretic Approach to Cardinality Estimation", companion article to the keynote talk at ICDT 2022. [ pdf ]
  • Yisu Remy Wang, Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, and Dan Suciu "Optimizing Recursive Queries with Program Synthesis", SIGMOD 2022. [ArXiV version]
  • Best paper award 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]
  • Mahmoud Abo Khamis, Phokion Kolaitis,, Hung Q. Ngo, Dan Suciu "Decision Problems in Information Theory", ICALP 2020, [ArXiV version]
  • Mahmoud Abo Khamis, Phokion Kolaitis, Hung Q. Ngo, and Dan Suciu "Bag Query Containment and Information Theory", PODS 2020. [ArXiV version]
  • 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, 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
  • Best paper award Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra, "FAQ: Questions Asked Frequently", PODS 2016. [ArXiV version] [Talk slides]

Some Quotes

"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