Database Paper Browser

Back to papers

Efficient Rank Join with Aggregation Constraints

Summary: Aggregation constraints enrich rank-join semantics, enabling user preferences in top-k queries. The paper develops deterministic and probabilistic algorithms that push constraints into rank-join rather than post-filtering, beating naive pipelines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10185
Venue
VLDB
Year
2011
Pagerank
4.1905499e-05
Overall Rank
12,199 | 15.22%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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 12 of 12 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

Overall Rank Paper Year Venue Pagerank
5,379 Robust and Efficient Algorithms for Rank Join Evaluation 2009 SIGMOD 5.5375923e-05
10,289 Efficient Query Repair for Aggregate Constraints 2026 VLDB 4.1905499e-05
6,136 RankSQL: Supporting Ranking Queries in Relational Database Management Systems 2005 VLDB 5.1906626e-05
4,072 Proximity Rank Join 2010 VLDB 6.4726748e-05
551 Supporting Incremental Join Queries on Ranked Inputs 2001 VLDB 0.00020310856
7,660 Processing Top-k Join Queries 2010 VLDB 4.6814547e-05
2,965 Evaluating Rank Joins with Optimal Cost 2008 PODS 7.8049517e-05
7,165 Ranked Enumeration of Join Queries with Projections 2022 VLDB 4.807833e-05
8,065 Efficient Computation of Quantiles over Joins 2023 PODS 4.5899218e-05
2,249 Rank-aware Query Optimization 2004 SIGMOD 9.1956569e-05