Centre de documentation
scientifique

Indexing the trajectories of moving objects in networks / V. Texeira De Almeida in Geoinformatica, vol 9 n° 1 (March - May 2005)  

Public [article]  inGeoinformatica > vol 9 n° 1 (March - May 2005) . - pp 33 - 60 Titre : Indexing the trajectories of moving objects in networks Type de document : Article/Communication Auteurs : V. Texeira De Almeida, Auteur ; Ralf Hartmut Güting, Auteur Année de publication : 2005 Article en page(s) : pp 33 - 60 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Bases de données localisées [Termes IGN] arbre-R [Termes IGN] base de données d'objets mobiles [Termes IGN] base de données spatiotemporelles [Termes IGN] indexation spatiale [Termes IGN] navigation [Termes IGN] objet mobile [Termes IGN] requête spatiale [Termes IGN] réseau ferroviaire [Termes IGN] réseau routier [Termes IGN] trajectoire (véhicule non spatial) Résumé : (Auteur) The management of moving objects has been intensively studied in recent years. A wide and increasing range dose applications has to deal with spatial objects whose position changes continuously over time, called moving objects. The main interest of these applications is to efficiently store and query the positions of these continuously moving objects. To achieve this goal, index structures are required. The main proposals of index structures for moving objects deal with unconstrained 2-dimensional movement. Constrained movement is a special and a very important case of object movement. For example, cars move in roads and trains in railroads. In this paper we propose a new index structure for moving objects on networks, the MON-Tree. We describe two network models that can be indexed by the MON-Tree. The first model is edge oriented, i.e., the network is of nodes and edges and there is a polyline associated to each edge. The second one is more suitable for transportation networks and is route oriented, i.e., the network consists of routes and junctions. In this model, a polyline also serves as a representation of the routes. We propose the index in terms of the basic algorithms for insertion and querying. We test our proposal in an extensive experimental evaluation with generated data sets using as underlying networks the roads of Germany. In our tests, the MON-Tree shows good scalability and outperforms the competing index structures in updating (index creation) as well as in querying. Numéro de notice : A2005-073 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Article DOI : 10.1007/s10707-004-5621-7 En ligne : https://doi.org/10.1007/s10707-004-5621-7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=27211 [article]

Exemplaires(1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-05011	RAB	Revue	Centre de documentation	En réserve L003	Disponible