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.13425451
- Overall Rank
- 423 | 98.01%
- 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 |
| 502 |
Worst-case Optimal Join Algorithms |
2012 |
PODS |
0.00021526612 |
| 583 |
FAQ: Questions Asked Frequently |
2016 |
PODS |
0.00019717214 |
| 1,442 |
What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? |
2017 |
PODS |
0.00011956109 |
| 1,557 |
Beyond Worst-case Analysis for Joins with Minesweeper |
2014 |
PODS |
0.00011392493 |
| 2,296 |
Joins via Geometric Resolutions: Worst-case and Beyond |
2015 |
PODS |
9.0776226e-05 |
| 2,907 |
Convergence of Datalog over (Pre-) Semirings |
2022 |
PODS |
7.933806e-05 |
| 3,006 |
On Functional Aggregate Queries with Additive Inequalities |
2019 |
PODS |
7.7299363e-05 |
| 3,277 |
A Layered Aggregate Engine for Analytics Workloads |
2019 |
SIGMOD |
7.2871625e-05 |
| 3,775 |
Bag Query Containment and Information Theory |
2020 |
PODS |
6.775636e-05 |
| 6,824 |
Computing Join Queries with Functional Dependencies |
2016 |
PODS |
4.9144789e-05 |
| 7,342 |
Optimizing Recursive Queries with Program Synthesis |
2022 |
SIGMOD |
4.7576316e-05 |
| 9,814 |
Optimizing Nested Recursive Queries |
2024 |
SIGMOD |
4.2783272e-05 |
| 9,843 |
Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints |
2025 |
PODS |
4.2721228e-05 |
| 10,929 |
Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs |
2024 |
PODS |
4.1945683e-05 |
| 11,982 |
Matching Titles with Cross Title Web-Search Enrichment and Community Detection |
2014 |
VLDB |
4.1945683e-05 |
Frequent Co-authors
Co-authored at least 5 papers.