Database Paper Browser

Back to papers

Proximity Rank Join

Summary: Proximity rank join: relations with scores and feature vectors; return top-K combos closest to a target and to each other. A tight bound guarantees instance-optimal I/O and drives adaptive pulling; experiments show gains vs HRJN-based methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10090
Venue
VLDB
Year
2010
Pagerank
6.4789031e-05
Overall Rank
4,069 | 71.70%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
2,480 Top-k Bounded Diversification 2012 SIGMOD 8.6899714e-05
12,182 Search Computing: Multi-domain Search on Ranked Data 2011 SIGMOD 4.1945683e-05
12,191 Efficient Rank Join with Aggregation Constraints 2011 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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
3,833 Output-optimal Parallel Algorithms for Similarity Joins 2017 PODS 6.7173578e-05
8,899 Fast Approximate Similarity Join in Vector Databases 2025 SIGMOD 4.427232e-05
8,061 Efficient Computation of Quantiles over Joins 2023 PODS 4.5943269e-05
552 Supporting Incremental Join Queries on Ranked Inputs 2001 VLDB 0.00020310903
5,855 Optimal Join Algorithms Meet Top-k 2020 SIGMOD 5.3006096e-05
7,692 Processing Top-k Join Queries 2010 VLDB 4.6761366e-05
2,393 Rank-aware Query Optimization 2004 SIGMOD 8.9016542e-05
12,191 Efficient Rank Join with Aggregation Constraints 2011 VLDB 4.1945683e-05
5,373 Robust and Efficient Algorithms for Rank Join Evaluation 2009 SIGMOD 5.5425231e-05
2,961 Evaluating Rank Joins with Optimal Cost 2008 PODS 7.8110394e-05