The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Capturing the Uncertainty of Moving-Object Representations
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
A Spatiotemporal Model and Language for Moving Objects on Road Networks
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Storage and Retrieval of Moving Objects
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
Query Processing for Moving Objects with Space-Time Grid Storage Model
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
IEEE Communications Magazine
Nearest neighbor queries in road networks
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Modeling and querying moving objects in networks
The VLDB Journal — The International Journal on Very Large Data Bases
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
A fastest route planning for LBS based on traffic prediction
ICS'05 Proceedings of the 9th WSEAS International Conference on Systems
Adaptive navigation of vehicles in congested road networks
Proceedings of the 5th international conference on Pervasive services
A critical evaluation of location based services and their potential
Journal of Location Based Services
Shortest paths in time-dependent FIFO networks using edge load forecasts
Proceedings of the Second International Workshop on Computational Transportation Science
On distributed time-dependent shortest paths over duty-cycled wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Finding top-k shortest path distance changes in an evolutionary network
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Efficient dynamic traffic navigation with hierarchical aggregation tree
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
The system for predicting the traffic flow with the real-time traffic information
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Arrival time dependent shortest path by on-road routing in mobile ad-hoc network
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
The weighted shortest path search based on multi-agents in mobile GIS management services
Wireless Communications & Mobile Computing
| Hi-index | 0.00 |
We model a moving object as a sizable physical entity equipped with GPS, wireless communication capability, and a computer. Based on a grid model, we develop a distributed system, FATES, to manage data for moving objects in a two-dimensional space. The system is used to provide time-dependent shortest paths for moving objects. The performance study shows that FATES yields shorter average trip time when there is a more congested route than any other routes in the domain space.