Database Paper Browser

Back to papers

GORDER: An Efficient Method for KNN Join Processing

Summary: GORDER: a G-ordering KNN-join via a block-nested-loop (BNLJ) for high-dimensional data. It uses G-order sorting, scheduled BNLJ, and distance filtering/reduction to reduce I/O and CPU, achieving wide-margin gains over existing KNN-join methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9185
Venue
VLDB
Year
2004
Pagerank
5.3924438e-05
Overall Rank
5,646 | 60.77%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
1,927 Efficient Processing of k Nearest Neighbor Joins using MapReduce 2012 VLDB 0.00010062395
4,808 On the Complexity of Inner Product Similarity Join 2016 PODS 5.9040739e-05
6,802 An Incremental Hausdorff Distance Calculation Algorithm 2011 VLDB 4.9172931e-05
8,629 Spatial Queries with Two kNN Predicates 2012 VLDB 4.4766922e-05
9,353 Rank Join Queries in NoSQL Databases 2014 VLDB 4.3485003e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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