Querying imprecise data in moving object environments

摘要: In moving object environments, it is infeasible for the database tracking movement of objects to store exact locations at all times. Typically, location an known with certainty only time update. The uncertainty in its increases until next this environment, possible queries produce incorrect results based upon old data. However, if degree controlled, then error answers can be reduced. More generally, query augmented probabilistic estimates validity answer. We study execution range and nearest-neighbor queries. imprecision inherent property these applications due data, unlike techniques approximate processing that trade accuracy performance. Algorithms computing are presented a generic model detailed solutions discussed two common models databases. performance through extensive simulations.