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.
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: