Hashing Moving Objects

A new idea based on hashing technique: using buckets to hold moving objects and the database does not make any change until an object moves into a new bucket; therefore, the database update cost is greatly reduced.

Abstract

In many real-life applications, objects need to be both spatially and temporally referenced.With the advancements of wireless communication and positioning technologies, the demand for storing and indexing moving objects, which are the objects continuously changing their locations, in database systems rises. However, current static spatial index structures are not well suited for handling large volume of moving objects due to massive and complex database update operations. In this paper, we propose a new idea based on hashing technique: using buckets to hold moving objects. The database does not make any change until an object moves into a new bucket; therefore, the database update cost is greatly reduced. Then, we extend the design of existing system structure by inserting a .lter layer between the position information collectors and the database. Based on the new system structure, we also present two indexing methods. Finally, di.erent aspects of our indexing techniques are evaluated.