FATES: Finding A Time dEpendent Shortest path
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Shape-Based Similarity Query for Trajectory of Mobile Objects
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Location dependent query in a mobile environment
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Introduction to multimedia and mobile agents
Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient Processing of Continual Range Queries for Location-Aware Mobile Services
Information Systems Frontiers
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
IMPACT: a twin-index framework for efficient moving object query processing
Data & Knowledge Engineering
Indexing moving objects based on 2 n index tree
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
Extended general motion model: an assembled object oriented model for moving objects
SEPADS'07 Proceedings of the 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Adaptive navigation of vehicles in congested road networks
Proceedings of the 5th international conference on Pervasive services
Towards optimal utilization of main memory for moving object indexing
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Ordered polyline trees for efficient search of objects moving on a graph
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part I
| Hi-index | 0.00 |
With the growing popularity of mobile computing devices and wireless communications, managing dynamically changing information about moving objects is becoming feasible. In this paper, we implement a system that manages such information and propose two new algorithms. One is an efficient range query algorithm propose an efficient range query algorithm with a filtering step which efficiently determines if a polyline corresponding to the trajectory of a moving object intersects with a given range. We study the performance of the system, which shows that despite the filtering step, for moderately large ranges, the range query algorithm we propose outperforms the algorithm without filtering.