Join Size Bounds using l_p-Norms on Degree Sequences
Summary: Extends information-theoretic join-size bounds with l_p-norms of degree sequences, yielding tighter estimates for acyclic and cyclic queries. Includes a matching evaluation algorithm; bounds are exponential-time computable and provably tight when degrees are simple. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mahmoud Abo Khamis
- 2. Vasileios Nakos
- 3. Dan Olteanu
- 4. Dan Suciu
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,967 | LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences | 2025 | SIGMOD | 4.875312e-05 |
| 7,122 | Debunking the Myth of Join Ordering: Toward Robust SQL Analytics | 2025 | SIGMOD | 4.8199209e-05 |
| 7,887 | SQLStorm: Taking Database Benchmarking into the LLM Era | 2025 | VLDB | 4.6218382e-05 |
| 9,843 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS | 4.2680295e-05 |
| 10,149 | CorrBound: Cardinality Estimation Accounting for Inter- and Intra-relation Correlations | 2026 | SIGMOD | 4.1905499e-05 |
| 10,455 | LpBound in Action: Cardinality Estimation with One-Sided Guarantees | 2025 | SIGMOD | 4.1905499e-05 |
| 10,498 | HoneyComb: A Parallel Worst-Case Optimal Join on Multicores | 2025 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 71 | How Good Are Query Optimizers, Really? | 2016 | VLDB | 0.00059446482 |
| 1,452 | What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? | 2017 | PODS | 0.00011922523 |
| 1,638 | Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation | 2022 | VLDB | 0.00011050093 |
| 2,143 | Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities | 2019 | SIGMOD | 9.4437798e-05 |
| 3,269 | Learned Cardinality Estimation: An In-depth Study | 2022 | SIGMOD | 7.3026051e-05 |
| 3,516 | Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs | 2022 | VLDB | 7.018912e-05 |
| 3,782 | Bag Query Containment and Information Theory | 2020 | PODS | 6.7691169e-05 |
| 4,526 | Simplicity Done Right for Join Ordering | 2021 | CIDR | 6.1079584e-05 |
| 5,978 | SafeBound: A Practical System for Generating Cardinality Bounds | 2023 | SIGMOD | 5.2424396e-05 |
| 6,822 | Computing Join Queries with Functional Dependencies | 2016 | PODS | 4.9101655e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,752 | Size and Treewidth Bounds for Conjunctive Queries | 2009 | PODS | 5.3393414e-05 |
| 2,254 | Two-Level Sampling for Join Size Estimation | 2017 | SIGMOD | 9.1871115e-05 |
| 3,519 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0181381e-05 |
| 100 | On the Propagation of Errors in the Size of Join Results | 1991 | SIGMOD | 0.00050033475 |
| 503 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021517145 |
| 1,621 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD | 0.00011105663 |
| 9,843 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS | 4.2680295e-05 |
| 11,703 | Tighter Upper Bounds for Join Cardinality Estimates | 2018 | SIGMOD | 4.1905499e-05 |
| 5,085 | Guaranteeing the O~(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins | 2023 | PODS | 5.7040225e-05 |
| 6,967 | LpBound: Pessimistic Cardinality Estimation using ℓp-Norms of Degree Sequences | 2025 | SIGMOD | 4.875312e-05 |