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: h9d9376e0da226cbc
Venue: VLDB
Year: 2010
Pagerank: 6.0007533e-05
Overall Rank: 5,769 | 61.22%
DOI: 10.14778/1920841.1920889

Incoming Non-self Citations Over Time

Authors

1. Davide Martinenghi (Politecnico di Milano)
2. Marco Tagliasacchi (Politecnico di Milano)

BibTeX Citation

@article{martinenghi_vldb10,
        title = {{Proximity Rank Join}},
        author = {Martinenghi, Davide and Tagliasacchi, Marco},
        journal = {PVLDB},
        series = {{VLDB} '10},
        volume = {3},
        number = {1},
        pages = {352--363},
        doi = {10.14778/1920841.1920889},
        url = {https://doi.org/10.14778/1920841.1920889},
        year = {2010}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,174	Top-k Bounded Diversification	2012	SIGMOD	8.917444e-05
12,668	Search Computing: Multi-domain Search on Ranked Data	2011	SIGMOD	4.9793485e-05
12,677	Efficient Rank Join with Aggregation Constraints	2011	VLDB	4.9793485e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
5	Optimal Aggregation Algorithms for Middleware [Extended Abstract]	2001	PODS	0.0010679641
524	Supporting Top-k Join Queries in Relational Databases	2003	VLDB	0.00016909926
1,552	Incremental Distance Join Algorithms for Spatial Databases	1998	SIGMOD	0.00010275036
1,635	Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases	2008	VLDB	0.00010017067
2,614	Evaluating Rank Joins with Optimal Cost	2008	PODS	8.2255837e-05
5,229	Robust and Efficient Algorithms for Rank Join Evaluation	2009	SIGMOD	6.2196057e-05
7,247	Depth Estimation for Ranking Query Optimization	2007	VLDB	5.5748328e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,464	Output-optimal Parallel Algorithms for Similarity Joins	2017	PODS
2	8,408	Fast Approximate Similarity Join in Vector Databases	2025	SIGMOD
3	7,435	Efficient Computation of Quantiles over Joins	2023	PODS
4	507	Supporting Incremental Join Queries on Ranked Inputs	2001	VLDB
5	4,752	Optimal Join Algorithms Meet Top-k	2020	SIGMOD
6	7,615	Processing Top-k Join Queries	2010	VLDB
7	1,773	Rank-aware Query Optimization	2004	SIGMOD
8	12,677	Efficient Rank Join with Aggregation Constraints	2011	VLDB
9	5,229	Robust and Efficient Algorithms for Rank Join Evaluation	2009	SIGMOD
10	2,614	Evaluating Rank Joins with Optimal Cost	2008	PODS