Towards real-time processing of monitoring continuous k-nearest neighbor queries

This paper addresses the problem of monitoring continuous k-nearest neighbor (k-NN) queries. In order to support highly dynamic environments, where objects and/or queries are frequently moving, monitoring continuous k-NN require real-time updated results when objects and/or queries change their locations. Thus, it is important to minimize time delay for maintaining up to date the results. In this paper, we present the monitoring method to shorten time delay for updating continuous k-NN queries based on the notion of result region and the minimum bounding rectangle enclosing all objects inside each cell, referred to as cMBR, in the main-memory grid index structure. Simulations are conducted to show the efficiency of the proposed method.