Reproducibility Report for ACM SIGMOD 2025 Paper: 'LpBound: Pessimistic Cardinality Estimation Using ? p -Norms of Degree Sequences'
Open Access
- 22 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 75-81
Abstract
We successfully reproduced the core findings and performance results of the paper ''LpBound: Pessimistic cardinality Estimation Using ℓp-Norms of Degree Sequences''. The paper proposed an intriguing bridge between information theory and cardinality estimation and derives tight upper bounds of the intermediate cardinalities by combining Shannon inequalities, ℓp-norms, and linear programming. The authors provided scripts to execute the experiments, the original datasets, and comprehensive, well-written documentation that allowed to reproduce of the core results.Keywords
Funding Information
- RelationalAI ()
- Swiss National Science Foundation (SNSF) (SNSF 200021-231956)
- NSF (National Science Foundation) (NSF-BSF 2109922, NSF IIS 2314527, NSF SHF 2312195)
This publication has 6 references indexed in Scilit:
- LpBound : Pessimistic Cardinality Estimation Using ℓ p -Norms of Degree SequencesProceedings of the ACM on Management of Data, 2025
- SafeBound: A Practical System for Generating Cardinality BoundsProceedings of the ACM on Management of Data, 2023
- FactorJoin: A New Cardinality Estimation Framework for Join QueriesProceedings of the ACM on Management of Data, 2023
- Cardinality estimation in DBMSProceedings of the VLDB Endowment, 2021
- NeuroCardProceedings of the VLDB Endowment, 2020
- How good are query optimizers, really?Proceedings of the VLDB Endowment, 2015