Database Paper Browser

Back to papers

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)

Paper ID
1684
Venue
PODS
Year
2016
Pagerank
4.9144789e-05
Overall Rank
6,824 | 52.53%
DOI
10.1145/2902251.2902289

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 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
502 Worst-case Optimal Join Algorithms 2012 PODS 0.00021526612
613 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00019181325
1,939 From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System 2015 SIGMOD 0.00010025655
2,936 Querying with Access Patterns and Integrity Constraints 2015 VLDB 7.8554347e-05
Previous Page 1 / 1 Next

Semantically Similar Papers