Indexing the Trajectories of Moving Objects in Networks (Extended Abstract)

The management of moving objects has been intensively studied in recent years.A wide and increasingrange of database applications has to deal with spatial objects whose position changes continuously over time. The main interest of these applications is to efficiently storeand query the positions of these objects. To achieve thisgoal, index structures are required. Most of the proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. The constrainedmovement is a special and a very important case of objectmovement. In this paper we propose a new index structure for moving objects in networks,the MON-Tree. We tested our proposal in an experimental evaluation withgenerated data sets. The MON-Tree showed good scalability when increasing the number of objects and time units in the index structure, and the query window and time interval in querying.