Continuous nearest-neighbor queries with location uncertainty

Continuous nearest-neighbor queries with location uncertainty In this paper, we consider the problem of evaluating the continuous query of finding the $$k$$ k nearest objects with respect to a given point object $$O_{q}$$ O q among a set of $$n$$ n moving point-objects. The query returns a sequence of answer-pairs, namely pairs of the form $$(I,\, S)$$ ( I , S ) such that $$I$$ I is a time interval and $$S$$ S is the set of objects that are closest to $$O_{q}$$ O q during $$I$$ I . When there is uncertainty associated with the locations of the moving objects, $$S$$ S is the set of all the objects that are possibly the $$k$$ k nearest neighbors. We analyze the lower bound and the upper bound on the maximum number of answer-pairs, for the certain case and the uncertain case, respectively. Then, we consider two different types of algorithms. The first is off-line algorithms that compute a priori all the answer-pairs. The second type is on-line algorithms that at any time return the current answer-pair. We present algorithms for the certain case and the uncertain case, respectively, and analyze their complexity. We experimentally compare different algorithms using a database of 1 million objects derived from real-world GPS traces. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Continuous nearest-neighbor queries with location uncertainty

Loading next page...
 
/lp/springer_journal/continuous-nearest-neighbor-queries-with-location-uncertainty-CPM4u9trd0
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2015 by Springer-Verlag Berlin Heidelberg
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-014-0361-2
Publisher site
See Article on Publisher Site

Abstract

In this paper, we consider the problem of evaluating the continuous query of finding the $$k$$ k nearest objects with respect to a given point object $$O_{q}$$ O q among a set of $$n$$ n moving point-objects. The query returns a sequence of answer-pairs, namely pairs of the form $$(I,\, S)$$ ( I , S ) such that $$I$$ I is a time interval and $$S$$ S is the set of objects that are closest to $$O_{q}$$ O q during $$I$$ I . When there is uncertainty associated with the locations of the moving objects, $$S$$ S is the set of all the objects that are possibly the $$k$$ k nearest neighbors. We analyze the lower bound and the upper bound on the maximum number of answer-pairs, for the certain case and the uncertain case, respectively. Then, we consider two different types of algorithms. The first is off-line algorithms that compute a priori all the answer-pairs. The second type is on-line algorithms that at any time return the current answer-pair. We present algorithms for the certain case and the uncertain case, respectively, and analyze their complexity. We experimentally compare different algorithms using a database of 1 million objects derived from real-world GPS traces.

Journal

The VLDB JournalSpringer Journals

Published: Feb 1, 2015

References

  • Modeling moving objects over multiple granularities
    Hornsby, K; Egenhofer, M

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