The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries
Summary: V*-Diagram is a query-dependent safe-region method for MkNN queries that uses the query position and search-space context, not data objects alone. It reduces IO and computation dramatically, with experiments showing ~100× speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sarana Nutanong
- 2. Rui Zhang
- 3. Egemen Tanin
- 4. Lars Kulik
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,545 | Monitoring Path Nearest Neighbor in Road Networks | 2009 | SIGMOD | 0.00011428609 |
| 3,523 | Efficient Proximity Detection among Mobile Users via Self-Tuning Policies | 2010 | VLDB | 7.0082046e-05 |
| 6,632 | Global Immutable Region Computation | 2014 | SIGMOD | 4.9803909e-05 |
| 7,751 | Computing Immutable Regions for Subspace Top-k Queries | 2013 | VLDB | 4.6562296e-05 |
| 8,591 | Boosting Moving Object Indexing through Velocity Partitioning | 2012 | VLDB | 4.4851366e-05 |
| 8,928 | Processing Moving kNN Queries Using Influential Neighbor Sets | 2015 | VLDB | 4.4229886e-05 |
| 11,209 | Closest Pairs Search Over Data Stream | 2023 | SIGMOD | 4.1905499e-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.0032118946 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016113151 |
| 48 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.0006954126 |
| 391 | Query Processing in Spatial Network Databases | 2003 | VLDB | 0.00024560891 |
| 434 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD | 0.00023277433 |
| 597 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB | 0.00019450818 |
| 985 | An Efficient and Scalable Approach to CNN Queries in a Road Network | 2005 | VLDB | 0.00014834799 |
| 1,272 | Continuous Nearest Neighbor Search | 2002 | VLDB | 0.00012871443 |
| 1,916 | A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects | 2005 | SIGMOD | 0.00010110473 |
| 3,802 | Time-Parameterized Queries in Spatio-Temporal Databases | 2002 | SIGMOD | 6.7524078e-05 |
| 3,815 | Location-based Spatial Queries | 2003 | SIGMOD | 6.7314038e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,272 | Continuous Nearest Neighbor Search | 2002 | VLDB | 0.00012871443 |
| 1,924 | Reverse kNN Search in Arbitrary Dimensionality | 2004 | VLDB | 0.00010075677 |
| 5,917 | VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries | 2010 | VLDB | 5.2690256e-05 |
| 3,018 | Approximate NN Queries on Streams with Guaranteed Error/performance Bounds | 2004 | VLDB | 7.6995792e-05 |
| 8,629 | Spatial Queries with Two kNN Predicates | 2012 | VLDB | 4.4766922e-05 |
| 3,574 | Efficient k-NN Search on Vertically Decomposed Data | 2002 | SIGMOD | 6.9520978e-05 |
| 8,554 | Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN | 2009 | VLDB | 4.4893996e-05 |
| 597 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB | 0.00019450818 |
| 3,415 | Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates | 2003 | VLDB | 7.1162894e-05 |
| 8,928 | Processing Moving kNN Queries Using Influential Neighbor Sets | 2015 | VLDB | 4.4229886e-05 |