Computing Join Queries with Functional Dependencies
Summary: Algorithm that computes joins with functional dependencies within the GLVV polymatroid output-size bound up to polylog factors, achieving worst-case optimality when GLVV is tight. Extends GLVV via the lattice of FD-closed sets, proves tightness on distributive lattices, handles degree/cardinality bounds, and turns polymatroid proofs into algorithms. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mahmoud Abo Khamis (LogicBlox Inc.; State University of New York at Buffalo)
- 2. Hung Q. Ngo (LogicBlox Inc.; State University of New York at Buffalo)
- 3. Dan Suciu (LogicBlox Inc.; University of Washington)
BibTeX Citation
@inproceedings{khamis_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Computing Join Queries with Functional Dependencies}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902289},
doi = {10.1145/2902251.2902289},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Khamis, Mahmoud Abo and Ngo, Hung Q. and Suciu, Dan},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 402 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00019104625 |
| 466 | Design and Implementation of the LogicBlox System | 2015 | SIGMOD | 0.00017773029 |
| 1,292 | From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System | 2015 | SIGMOD | 0.00011152286 |
| 3,000 | Querying with Access Patterns and Integrity Constraints | 2015 | VLDB | 7.7669839e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 315 | Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems | 2018 | PODS |
| 2 | 1,812 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS |
| 3 | 10,386 | Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries | 2026 | PODS |
| 4 | 10,508 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD |
| 5 | 8,212 | Tight Fine-Grained Bounds for Direct Access on Join Queries | 2022 | PODS |
| 6 | 402 | Worst-case Optimal Join Algorithms | 2012 | PODS |
| 7 | 7,141 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS |
| 8 | 10,182 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS |
| 9 | 6,467 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 10 | 6,043 | Size and Treewidth Bounds for Conjunctive Queries | 2009 | PODS |