Reverse kNN Search in Arbitrary Dimensionality
Summary: Exact reverse kNN (RkNN) processing for arbitrary k on dynamic multidimensional data, delivering true exact results. Uses a conventional data-partitioning index with no pre-computation and outperforms 2D-only, approximate, or non-updatable methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yufei Tao
- 2. Dimitris Papadias
- 3. Xiang Lian
Incoming Citations (Sorted by Pagerank)
Showing 19 of 19 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 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 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 47 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.0007015885 |
| 129 | The X-tree: An Index Structure for High-Dimensional Data | 1996 | VLDB | 0.0004429571 |
| 601 | Influence Sets Based on Reverse Nearest Neighbor Queries | 2000 | SIGMOD | 0.00019375875 |
| 1,172 | Processing Queries By Linear Constraints | 1997 | PODS | 0.00013505441 |
| 1,528 | A Model for the Prediction of R-tree Performance | 1996 | PODS | 0.00011497734 |
| 1,682 | Discovery of Influence Sets in Frequently Updated Databases | 2001 | VLDB | 0.00010923103 |
| 2,702 | Reverse Nearest Neighbor Aggregates Over Data Streams | 2002 | VLDB | 8.2725214e-05 |
Previous
Page 1 / 1
Next