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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

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

Loading next page...
 
/lp/springer_journal/analysis-and-evaluation-of-v-k-nn-an-efficient-algorithm-for-moving-k-FgzaXIbqDH
Publisher
Springer-Verlag
Copyright
Copyright © 2010 by Springer-Verlag
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-009-0163-0
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

The VLDB JournalSpringer Journals

Published: Jun 1, 2010

References

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 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

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

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off