DBScholar

Back to papers

Tighter Upper Bounds for Join Cardinality Estimates

Summary: Tightens join cardinality upper bounds via data sketching and randomized hashing to help optimizers prune costly multiway plans. Extends to multiway cyclic joins; evaluates tightness on GooglePlus graphs, delivering degree-of-magnitude upper bounds and proposing a new join-statistic for plan selection. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5496
Venue
SIGMOD
Year
2018
Pagerank
5.093636e-05
Overall Rank
11,902 | 18.35%
DOI
10.1145/3183713.3183714

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{cai_sigmod18,
        title = {{Tighter Upper Bounds for Join Cardinality Estimates}},
        author = {Cai, Walter},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3183714},
        url = {https://dl.acm.org/doi/10.1145/3183713.3183714},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 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