Skip to main content
Article thumbnail
Location of Repository

RANGE AND NEAREST NEIGHBOR QUERIES ON UNCERTAIN SPATIOTEMPORAL DATA

By Yufei Tao

Abstract

Uncertain data are abundant in numerous spatiotemporal applications providing location-based services. This chapter will first review these applications and explain why uncertainty is inherent, sometimes even intended, in their underlying data. Then, we will address two classical spatial queries: range search and nearest neighbor retrieval. We will see that the presence of uncertainty requires extending the traditional definitions of both queries, and thus, also invalidates the conventional algorithms designed for precise databases. We will survey the existing the variations of both queries specifically formulated on uncertain data. Finally, the algorithms for efficiently processing these queries will also be discussed.

Publisher: 2014-02-20
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.2001
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://link.springer.com/conte... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.