Indexing the Trajectories of Moving Objects in Networks (Extended Abstract)
Victor Teixeira de Almeida, Ralf Hartmut Güting · 2004
Victor Teixeira de Almeida Ralf Hartmut Guting Praktische Informatik IV Fernuniversitat Hagen, D-58084 Hagen, Germany {victor.almeida, rhg}@fernuni-hagen.de Abstract studied in recent years. A wide and increasing range of database applications has to deal with spatial objects whose position changes continuously over time. The main interest of these applications is to e#ciently store and query the positions of these objects. To achieve this goal, index structures are required. Most of the proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. The constrained movement is a special and a very important case of object movement. 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 with generated data sets. TheMON-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.