Data Management

Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse k-NN

Free registration required

Executive Summary

In this paper, the authors study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive towards objects and queries movement. For example, the results of a query are to be recomputed whenever the query changes its location. They present a framework for continuous reverse k nearest neighbor queries by assigning each object and query with a rectangular safe region such that the expensive recomputation is not required as long as the query and objects remain in their respective safe regions.

  • Format: PDF
  • Size: 407.4 KB