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

  • Authors:

  • HaRim Jung;Sang-Won Kang;MoonBae Song;SeokJin Im;Jongwan Kim;Chong-Sun Hwang

  • Affiliations:

  • Department of Computer Science and Engineering, Korea University, Seoul, Korea;Department of Computer Science and Engineering, Korea University, Seoul, Korea;Department of Computer Science and Engineering, Korea University, Seoul, Korea;Department of Computer Science and Engineering, Korea University, Seoul, Korea;Department of Computer Science and Engineering, Korea University, Seoul, Korea;Department of Computer Science and Engineering, Korea University, Seoul, Korea

  • Venue:
  • ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.