Abstract

In this paper we first introduce Moving Objects Databases and their related research problems. Then we concentrate on a particular problem, namely reducing the information cost associated with a trip taken by some moving object (e.g. a vehicle). The information cost of a trip consists of the overhead of position-update messages and the deviation of the database position from the actual position of the object. We introduce two position update policies, namely plain dead reckoning (pdr) and adaptive dead reckoning (adr). We show that adr has a lower information cost than pdr. 2 Introduction 2.1 Moving Objects Databases and Relevant Research Consider a database that represents information about moving objects and their position. For example, for a database representing the location of taxi-cabs a typical query may be: retrieve the free cabs that are currently within 1 mile of 33 N. Michigan Ave., Chicago (to pick-up a customer); or for a trucking company database a typical query may be:...

Citations