A Framework for Generating Network-Based Moving Objects
Geoinformatica
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Indexing of network constrained moving objects
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Indexing of Constrained Moving Objects for Current and Near Future Positions in GIS
IMSCCS '06 Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 2 (IMSCCS'06) - Volume 02
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Fast indexing and updating method for moving objects on road networks
WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
Optimizing predictive queries on moving objects under road-network constraints
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Predictive line queries for traffic prediction
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
| Hi-index | 0.00 |
In this paper, a new access method is proposed for current positions of moving objects on road networks in order to efficiently update their positions. In the existing index structures, the connectivity of edges is lost because the intersection points in which three or more edges are split. The proposed index structure preserves the network connectivity, which uses intersection oriented network model by not splitting intersection nodes that three or more edges meet for preserving the connectivity of adjacent road segments. The data node stores not only the positions of moving object but also the connectivity of networks.