A consistent hierarchical representation for vector data
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
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
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
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
Using space-time grid for efficient management of moving objects
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Approximate Nearest Neighbor Searching in Multimedia Databases
Proceedings of the 17th International Conference on Data Engineering
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient Processing of Spatial Queries in Line Segment Databases
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
Load balancing in NEST: a network of workstations
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Buddy tracking - efficient proximity detection among mobile friends
Pervasive and Mobile Computing
Snapshot location-based query processing on moving objects in road networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Trees or grids?: indexing moving objects in main memory
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Querying the future of spatio-temporal objects
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
The VLDB Journal — The International Journal on Very Large Data Bases
Motion-Alert: automatic anomaly detection in massive moving objects
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Incremental rank updates for moving query points
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Continuous queries on trajectories of moving objects
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Predictive spatio-temporal queries: a comprehensive survey and future directions
Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
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 query algorithms: a range query algorithm and a k nearest neighbor algorithm. The range query algorithm is combined with an efficient filtering technique which 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.