Querying Imprecise Data in Moving Object Environments

DMCA

Querying Imprecise Data in Moving Object Environments (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Reynold Cheng , Sunil Prabhakar , Dmitri V. Kalashnikov

Venue:	IEEE TKDE
Citations:	169 - 35 self

BibTeX

@ARTICLE{Cheng02queryingimprecise,
    author = {Reynold Cheng and Sunil Prabhakar and Dmitri V. Kalashnikov},
    title = {Querying Imprecise Data in Moving Object Environments},
    journal = {IEEE TKDE},
    year = {2002},
    volume = {16},
    pages = {2004}
}

OpenURL

Abstract

In moving object environments it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically the location of an object is known with certainty only at the time of the update. The uncertainty in its location increases until the next update. In this environment, it is possible for queries to produce incorrect results based upon old data. However, if the degree of uncertainty is controlled, then the error of the answers to certain queries can be reduced. More generally, query answers can be augmented with probabilistic estimates of the validity of the answer. In this paper we study the execution of such probabilistic nearest-neighbor queries. The imprecision in answers to the queries is an inherent property of these applications due to uncertainty in the data, unlike the techniques for approximate nearestneighbor processing that trade accuracy for performance.

Keyphrases

moving object environment imprecise data exact location approximate nearestneighbor processing probabilistic estimate certain query object environment next update incorrect result trade accuracy query answer probabilistic nearest-neighbor query inherent property location increase old data

DMCA