Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
Summary: Lazy updates for continuous reverse kNN monitoring using rectangular safe regions per query/object to avoid recomputation while inside. Reduces client-server traffic as updates occur only on exit or by server request; cost analysis and experiments show order-of-magnitude gains. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Muhammad Aamir Cheema (University of New South Wales)
- 2. Xuemin Lin (National ICT Australia; University of New South Wales)
- 3. Ying Zhang (University of New South Wales)
- 4. Wei Wang (National ICT Australia; University of New South Wales)
- 5. Wenjie Zhang (National ICT Australia; University of New South Wales)
BibTeX Citation
@article{cheema_vldb09,
title = {{Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN}},
author = {Cheema, Muhammad Aamir and Lin, Xuemin and Zhang, Ying and Wang, Wei and Zhang, Wenjie},
journal = {PVLDB},
series = {{VLDB} '09},
doi = {10.14778/1687627.1687755},
url = {https://doi.org/10.14778/1687627.1687755},
year = {2009}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,356 | Reverse k Nearest Neighbors Query Processing: Experiments and Analysis | 2015 | VLDB | 5.282937e-05 |
| 11,568 | Continuous Social Distance Monitoring in Indoor Space | 2022 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 546 | Influence Sets Based on Reverse Nearest Neighbor Queries | 2000 | SIGMOD | 0.00016734556 |
| 1,219 | Processing Queries By Linear Constraints | 1997 | PODS | 0.00011620957 |
| 1,281 | Continuous Nearest Neighbor Search | 2002 | VLDB | 0.00011349245 |
| 1,612 | Reverse kNN Search in Arbitrary Dimensionality | 2004 | VLDB | 0.00010218134 |
| 1,698 | A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects | 2005 | SIGMOD | 9.980335e-05 |
| 2,205 | Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring | 2005 | SIGMOD | 8.9591376e-05 |
| 3,462 | Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates | 2003 | VLDB | 7.3922569e-05 |
| 5,664 | FINCH: Evaluating Reverse k-Nearest-Neighbor Queries on Location Data | 2008 | VLDB | 6.1289238e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,356 | Reverse k Nearest Neighbors Query Processing: Experiments and Analysis | 2015 | VLDB |
| 2 | 10,460 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD |
| 3 | 9,322 | An Adaptive Updating Protocol for Reducing Moving Object Database Workload | 2010 | VLDB |
| 4 | 5,987 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD |
| 5 | 3,710 | Efficient Reverse k-Nearest Neighbor Search in Arbitrary Metric Spaces | 2006 | SIGMOD |
| 6 | 1,612 | Reverse kNN Search in Arbitrary Dimensionality | 2004 | VLDB |
| 7 | 1,620 | Continuous Nearest Neighbor Monitoring in Road Networks | 2006 | VLDB |
| 8 | 9,080 | Processing Moving kNN Queries Using Influential Neighbor Sets | 2015 | VLDB |
| 9 | 2,205 | Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring | 2005 | SIGMOD |
| 10 | 3,462 | Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates | 2003 | VLDB |