DBScholar

Back to papers

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)

Paper ID
1959
Venue
PODS
Year
2024
Pagerank
5.9397944e-05
Overall Rank
6,257 | 57.08%
DOI
10.1145/3651597

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{khamis_pods24,
        address = {New York, NY, USA},
        series = {{PODS} '24},
        title = {{Join Size Bounds using l\_p-Norms on Degree Sequences}},
        url = {https://dl.acm.org/doi/10.1145/3651597},
        doi = {10.1145/3651597},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Khamis, Mahmoud Abo and Nakos, Vasileios and Olteanu, Dan and Suciu, Dan},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers