Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
Information Sciences: an International Journal
Trigger Based Security Alarming Scheme for Moving Objects on Road Networks
PAISI, PACCF and SOCO '08 Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics
Moving objects in networks databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
A network-based indexing method for trajectories of moving objects
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
| Hi-index | 0.00 |
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.