Back to authors
Hung Q. Ngo
- Author ID
- 5043
- ORCID
-
-
- Links
-
(found by gpt-5.2 on feb 8th, 2026)
- Most Frequent Institution
- RelationalAI
- Pagerank
- 0.13429696
- Overall Rank
- 437 | 97.91%
- Paper Count
- 15
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 15 of 15 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 503 |
Worst-case Optimal Join Algorithms |
2012 |
PODS |
0.00021517145 |
| 564 |
FAQ: Questions Asked Frequently |
2016 |
PODS |
0.00020002796 |
| 1,452 |
What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? |
2017 |
PODS |
0.00011922523 |
| 1,556 |
Beyond Worst-case Analysis for Joins with Minesweeper |
2014 |
PODS |
0.00011383141 |
| 2,298 |
Joins via Geometric Resolutions: Worst-case and Beyond |
2015 |
PODS |
9.0746479e-05 |
| 2,912 |
Convergence of Datalog over (Pre-) Semirings |
2022 |
PODS |
7.9261665e-05 |
| 3,009 |
On Functional Aggregate Queries with Additive Inequalities |
2019 |
PODS |
7.7230513e-05 |
| 3,280 |
A Layered Aggregate Engine for Analytics Workloads |
2019 |
SIGMOD |
7.2813732e-05 |
| 3,782 |
Bag Query Containment and Information Theory |
2020 |
PODS |
6.7691169e-05 |
| 6,822 |
Computing Join Queries with Functional Dependencies |
2016 |
PODS |
4.9101655e-05 |
| 7,338 |
Optimizing Recursive Queries with Program Synthesis |
2022 |
SIGMOD |
4.7531793e-05 |
| 9,813 |
Optimizing Nested Recursive Queries |
2024 |
SIGMOD |
4.2742278e-05 |
| 9,843 |
Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints |
2025 |
PODS |
4.2680295e-05 |
| 10,932 |
Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs |
2024 |
PODS |
4.1905499e-05 |
| 11,990 |
Matching Titles with Cross Title Web-Search Enrichment and Community Detection |
2014 |
VLDB |
4.1905499e-05 |
Frequent Co-authors
Co-authored at least 5 papers.