Database Paper Browser

Back to papers

Supporting Top-k Join Queries in Relational Databases

Summary: Rank-join algorithm exploits input orders to produce top-k join results under a user-specified score, ranking during join. Two nonblocking, ripple-join-based operators are integrated in pipelines; a PREDATOR prototype demonstrates superior performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9022
Venue
VLDB
Year
2003
Pagerank
0.00018325667
Overall Rank
673 | 95.33%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 51 citing papers.

Rank Citing Paper Year Venue Pagerank
12,308 Skip-and-Prune: Cosine-based Top-K Query Processing for Efficient Context-Sensitive Document Retrieval 2009 SIGMOD 4.1905499e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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
7,165 Ranked Enumeration of Join Queries with Projections 2022 VLDB 4.807833e-05
5,845 Optimal Join Algorithms Meet Top-k 2020 SIGMOD 5.3057391e-05
2,249 Rank-aware Query Optimization 2004 SIGMOD 9.1956569e-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
1,207 RankSQL: Query Algebra and Optimization for Relational Top-k Queries 2005 SIGMOD 0.0001327437
2,891 Joining Ranked Inputs in Practice 2002 VLDB 7.9577748e-05
5,379 Robust and Efficient Algorithms for Rank Join Evaluation 2009 SIGMOD 5.5375923e-05
6,136 RankSQL: Supporting Ranking Queries in Relational Database Management Systems 2005 VLDB 5.1906626e-05
7,660 Processing Top-k Join Queries 2010 VLDB 4.6814547e-05