What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?
Summary: Relates Shannon-type (Shannon flow) information inequalities to output-size bounds for disjunctive Datalog (generalizing CQs) under FDs, degree and input-cardinality bounds via “proof sequences”. Uses these sequences to drive PANDA, yielding algorithms that match fractional hypertree and exactly submodular-width runtimes. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mahmoud Abo Khamis (LogicBlox Inc.)
- 2. Hung Q. Ngo (LogicBlox Inc.)
- 3. Dan Suciu (LogicBlox Inc.; University of Washington)
BibTeX Citation
@inproceedings{khamis_pods17,
address = {New York, NY, USA},
series = {{PODS} '17},
title = {{What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?}},
url = {https://dl.acm.org/doi/10.1145/3034786.3056105},
doi = {10.1145/3034786.3056105},
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 = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 53 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,156 | Fast Matrix Multiplication meets the Submodular Width | 2025 | PODS | 4.9605343e-05 |
| 11,581 | Relational Algorithms for Top-k Query Evaluation | 2024 | SIGMOD | 4.9605343e-05 |
| 12,251 | Tighter Upper Bounds for Join Cardinality Estimates | 2018 | SIGMOD | 4.9605343e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 357 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020048899 |
| 397 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.0001911958 |
| 819 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00013623401 |
| 848 | Aggregation and Ordering in Factorised Databases | 2013 | VLDB | 0.00013463236 |
| 1,643 | SCADS: Scale-Independent Storage for Social Computing Applications | 2009 | CIDR | 9.9801601e-05 |
| 1,821 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS | 9.5466386e-05 |
| 2,018 | PIQL: Success-Tolerant Query Processing in the Cloud | 2012 | VLDB | 9.1687512e-05 |
| 2,997 | Querying with Access Patterns and Integrity Constraints | 2015 | VLDB | 7.7521998e-05 |
| 4,338 | Generalized Scale Independence Through Incremental Precomputation | 2013 | SIGMOD | 6.6413964e-05 |
| 4,473 | Bounded Conjunctive Queries | 2014 | VLDB | 6.570529e-05 |
| 6,278 | General and Fractional Hypertree Decompositions: Hard and Easy Cases | 2018 | PODS | 5.8092008e-05 |
| 6,761 | Computing Join Queries with Functional Dependencies | 2016 | PODS | 5.6705551e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,473 | Bounded Conjunctive Queries | 2014 | VLDB |
| 2 | 8,099 | Tight Bounds of Circuits for Sum-Product Queries | 2024 | PODS |
| 3 | 2,316 | On Functional Aggregate Queries with Additive Inequalities | 2019 | PODS |
| 4 | 10,469 | A Unifying Algorithm for Hierarchical Queries | 2026 | PODS |
| 5 | 6,051 | Size and Treewidth Bounds for Conjunctive Queries | 2009 | PODS |
| 6 | 11,156 | Fast Matrix Multiplication meets the Submodular Width | 2025 | PODS |
| 7 | 3,533 | Bag Query Containment and Information Theory | 2020 | PODS |
| 8 | 10,454 | Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time | 2026 | PODS |
| 9 | 10,220 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS |
| 10 | 10,460 | PANDAExpress: A Simpler and Faster PANDA Algorithm | 2026 | PODS |