Analysis and evaluation of V*- k NN: an efficient algorithm for moving k NN queries

Analysis and evaluation of V*- k NN: an efficient algorithm for moving k NN queries The moving k nearest neighbor (M k NN) query continuously finds the k nearest neighbors of a moving query point. M k NN queries can be efficiently processed through the use of safe regions. In general, a safe region is a region within which the query point can move without changing the query answer. This paper presents an incremental safe-region-based technique for answering M k NN queries, called the V*-Diagram , as well as analysis and evaluation of its associated algorithm, V*- k NN. Traditional safe-region approaches compute a safe region based on the data objects but independent of the query location. Our approach exploits the knowledge of the query location and the boundary of the search space in addition to the data objects. As a result, V*- k NN has much smaller I/O and computation costs than existing methods. We further provide cost models to estimate the number of data accesses for V*- k NN and a competitive technique, RIS- k NN. The V*-Diagram and V*- k NN are also applicable to the domain of spatial networks and we present algorithms to construct a spatial-network V*-Diagram. Our experimental results show that V*- k NN significantly outperforms the competitive technique. The results also verify the accuracy of the cost models. The VLDB Journal Springer Journals

Analysis and evaluation of V*- k NN: an efficient algorithm for moving k NN queries

Loading next page...
Copyright © 2010 by Springer-Verlag
Computer Science; Database Management
Publisher site
See Article on Publisher Site


You’re reading a free preview. Subscribe to read the entire article.

DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches


Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.



billed annually
Start Free Trial

14-day Free Trial