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)
Incoming Non-self Citations Over Time
Authors
- 1. Nikolaos Tziavelis (Northeastern University)
- 2. Nofar Carmeli (INRIA; National Centre for Scientific Research; University of Montpellier)
- 3. Wolfgang Gatterbauer (Northeastern University)
- 4. Benny Kimelfeld (Technion)
- 5. Mirek Riedewald (Northeastern University)
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.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,153 | Faster Relational Algorithms Using Geometric Data Structures | 2026 | PODS | 5.093636e-05 |
| 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS | 5.093636e-05 |
| 10,176 | Clustering with Set Outliers and Applications in Relational Clustering | 2026 | PODS | 5.093636e-05 |
| 11,144 | Improved Approximation Algorithms for Relational Clustering | 2024 | PODS | 5.093636e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010828372 |
| 261 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD | 0.00023097188 |
| 358 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020243592 |
| 2,777 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS | 8.1352657e-05 |
| 4,781 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS | 6.5116536e-05 |
| 5,593 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 6.1552328e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,622 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB |
| 2 | 499 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB |
| 3 | 2,585 | Evaluating Rank Joins with Optimal Cost | 2008 | PODS |
| 4 | 3,617 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS |
| 5 | 12,386 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB |
| 6 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 7 | 5,593 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB |
| 8 | 6,412 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |
| 9 | 10,154 | Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum | 2026 | PODS |
| 10 | 4,781 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS |