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)
Incoming Non-self Citations Over Time
Authors
- 1. Chenyi Xia
- 2. Hongjun Lu
- 3. Beng Chin Ooi
- 4. Jing Hu
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,931 | Efficient Processing of k Nearest Neighbor Joins using MapReduce | 2012 | VLDB | 0.00010040427 |
| 4,808 | On the Complexity of Inner Product Similarity Join | 2016 | PODS | 5.908896e-05 |
| 6,770 | An Incremental Hausdorff Distance Calculation Algorithm | 2011 | VLDB | 4.9317829e-05 |
| 8,629 | Spatial Queries with Two kNN Predicates | 2012 | VLDB | 4.4809879e-05 |
| 9,347 | Rank Join Queries in NoSQL Databases | 2014 | VLDB | 4.3526718e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 47 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.0007015885 |
| 148 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD | 0.00041182766 |
| 161 | LOF: Identifying Density-Based Local Outliers | 2000 | SIGMOD | 0.00039846974 |
| 925 | Partition Based Spatial-Merge Join | 1996 | SIGMOD | 0.00015264328 |
| 1,174 | Spatial Hash-Joins | 1996 | SIGMOD | 0.00013486418 |
| 1,631 | Incremental Distance Join Algorithms for Spatial Databases | 1998 | SIGMOD | 0.00011078269 |
| 1,806 | Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces | 2000 | VLDB | 0.00010490769 |
| 2,281 | Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data | 2001 | SIGMOD | 9.1077704e-05 |
| 2,900 | Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations | 1997 | VLDB | 7.9405413e-05 |
| 3,300 | Indexing the Distance: An Efficient Method to KNN Processing | 2001 | VLDB | 7.2516103e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,976 | Efficient Top-K SimRank-based Similarity Join | 2015 | VLDB | 5.7882361e-05 |
| 701 | Efficient Algorithms for Mining Outliers from Large Data Sets | 2000 | SIGMOD | 0.00017938417 |
| 9,953 | Distributed Stream KNN Join | 2021 | SIGMOD | 4.2405999e-05 |
| 8,562 | Contorting High Dimensional Data for Efficient Main Memory KNN Processing | 2003 | SIGMOD | 4.4937074e-05 |
| 8,899 | Fast Approximate Similarity Join in Vector Databases | 2025 | SIGMOD | 4.427232e-05 |
| 10,924 | Improved Approximation Algorithms for Relational Clustering | 2024 | PODS | 4.1945683e-05 |
| 8,164 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD | 4.5718104e-05 |
| 2,281 | Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data | 2001 | SIGMOD | 9.1077704e-05 |
| 3,141 | ClusterJoin: A Similarity Joins Framework using Map-Reduce | 2014 | VLDB | 7.4829448e-05 |
| 1,931 | Efficient Processing of k Nearest Neighbor Joins using MapReduce | 2012 | VLDB | 0.00010040427 |