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
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,002 | Clustering with Set Outliers and Applications in Relational Clustering | 2026 | PODS | 4.1905499e-05 |
| 10,928 | Improved Approximation Algorithms for Relational Clustering | 2024 | PODS | 4.1905499e-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 |
|---|---|---|---|---|
| 8 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0015436578 |
| 274 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD | 0.00029383266 |
| 564 | FAQ: Questions Asked Frequently | 2016 | PODS | 0.00020002796 |
| 3,386 | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 2020 | PODS | 7.151562e-05 |
| 5,859 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS | 5.2963939e-05 |
| 5,963 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2485815e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,163 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5685178e-05 |
| 10,336 | Towards Efficient Random-Order Enumeration for Join Queries | 2026 | VLDB | 4.1905499e-05 |
| 551 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310856 |
| 2,965 | Evaluating Rank Joins with Optimal Cost | 2008 | PODS | 7.8049517e-05 |
| 3,519 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0181381e-05 |
| 12,199 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB | 4.1905499e-05 |
| 3,702 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB | 6.8251643e-05 |
| 5,963 | Beyond Equi-joins: Ranking, Enumeration and Factorization | 2021 | VLDB | 5.2485815e-05 |
| 7,165 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.807833e-05 |
| 5,859 | Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 2021 | PODS | 5.2963939e-05 |