DBScholar

Back to papers

Efficient Computation of Quantiles over Joins

Summary: Pivot-based recursive method to compute join quantiles without materializing outputs, giving quasilinear-time algorithms for many monotone ranking functions. Prove min/max tractable for all acyclic JQs, extend the sum dichotomy to partial sums, and provide a deterministic approximation for intractable sum cases. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1921
Venue
PODS
Year
2023
Pagerank
5.655242e-05
Overall Rank
7,286 | 50.02%
DOI
10.1145/3584372.3588670

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{tziavelis_pods23,
        address = {New York, NY, USA},
        series = {{PODS} '23},
        title = {{Efficient Computation of Quantiles over Joins}},
        url = {https://dl.acm.org/doi/10.1145/3584372.3588670},
        doi = {10.1145/3584372.3588670},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Tziavelis, Nikolaos and Carmeli, Nofar and Gatterbauer, Wolfgang and Kimelfeld, Benny and Riedewald, Mirek},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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