Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Indexing the Trajectories of Moving Objects in Networks*

Indexing the Trajectories of Moving Objects in Networks* The management of moving objects has been intensively studied in recent years. A wide and increasing range of database 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 consists 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 scalabiliy and outperforms the competing index structures in updating (index creation) as well as in querying. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Geoinformatica Springer Journals

Indexing the Trajectories of Moving Objects in Networks*

de Almeida, Victor; Güting, Ralf
Geoinformatica , Volume 9 (1) – Nov 19, 2004
Download PDF
28 pages

Loading next page...
 
/lp/springer-journals/indexing-the-trajectories-of-moving-objects-in-networks-6QKvelAZpT

References (43)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Springer Science + Business Media, Inc.
Subject
Geography; Computer Science, general; Data Structures, Cryptology and Information Theory; Information Storage and Retrieval; Multimedia Information Systems
ISSN
1384-6175
eISSN
1573-7624
DOI
10.1007/s10707-004-5621-7
Publisher site
See Article on Publisher Site

Abstract

The management of moving objects has been intensively studied in recent years. A wide and increasing range of database 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 consists 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 scalabiliy and outperforms the competing index structures in updating (index creation) as well as in querying.

Journal

Geoinformatica – Springer Journals

Published: Nov 19, 2004

There are no references for this article.