Indexing objects moving on fixed networks
Web1 jun. 2006 · Moving objects databases have become an important research issue in recent years. For modeling and querying moving objects, there exists a comprehensive framework of abstract data types to describe objects moving freely in the 2D plane, providing data types such as moving point or moving region. However, in many … WebIn 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 …
Indexing objects moving on fixed networks
Did you know?
Web24 jul. 2003 · In this work, a new indexing technique, named Fixed Network R-Tree (FNR-Tree), is proposed for objects constrained to move on fixed networks in 2-dimensional … WebThe general idea behind an FNR tree is a forest of one-dimensional (1D) R-trees on top of a two-dimensional (2D) R-tree. 2D R-Trees are used to index the spatial data of the network (for example, roads consisting of line segments), while 1D R-Trees are used to index the time interval of movement of each object within a given link in the network.
WebIndexing objects moving on fixed networks. 10 0 0 500 1000 R3-Tree 0 1500 2000 0 500 1000 1500 2000 moving objects moving objects moving objects (a) (b) (c) ... 100% in each spatial dimension It is worth to note that on both networks, the ratio between node accesses of the FNR and the 3D R-Tree is conversely relative to the query size and the ... Web24 apr. 2024 · - In spatial-temporal applications, moving objects identify the particular locations called location based services and update the locations continuously to the server. Due to the enormous ...
Web1 jan. 2009 · Download Citation An Efficient Index Method for Moving Objects Databases in Fixed Networks Efficiency is an important subject in moving object databases … Web1 jun. 2010 · Currently many researches focus on objects freely moving on 2-dimensional space, and a lot of index strategies have been proposed, while they are not applicable …
WebIn 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. crafts using old crew socksWeb20 jun. 2010 · A grid based trajectory indexing method for moving objects on fixed network. Abstract: The management of moving objects is an intensive study area in … crafts using old glasswareWebIn 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 … dixies antelope canyon tour reviewsWebIn this work, a new indexing technique, named Fixed Network R-Tree (FNR-Tree), is proposed for objects constrained to move on fixed networks in 2-dimensional space. The … crafts using old knitting needlesWebfor objects moving on fixed networks is a very attractive challenge due to the great number of real-world spatiotemporal database applications and fleet management systems … dixie saloon mackinaw city menuWeb18 jul. 2006 · A new index structure for moving objects on networks, the MON-Tree is proposed in terms of the basic algorithms for insertion and querying and shows good … dixies chicken \\u0026 fish troutman ncWebIn this work, a new indexing technique, named Fixed Network R-Tree (FNR-Tree), is proposed for objects constrained to move on fixed networks in 2-dimensional space. The … crafts using old jewelry