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. The VLDB Journal Springer Journals

Continuous nearest-neighbor queries with location uncertainty

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


  • 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 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