Indexing Mobile Objects on the Plane Revisited
نویسندگان
چکیده
We present a set of time-efficient approaches to index objects moving on the plane to efficiently answer range queries about their future positions. Our algorithms are based on previously described solutions as well as on the employment of efficient data structures. Finally, an experimental evaluation is included that shows the performance, scalability and efficiency of our methods.
منابع مشابه
Embedding advanced geometric techniques into SQL for efficient indexing of mobile objects
It is of great importance a trial to embed new geometric techniques into SQL in order to achieve more efficient indexing of objects moving on the plane and answer range queries about their future positions. This problem is motivated by real-life applications, such as allocating more bandwidth for areas where high concentration of mobile phones is imminent, or predicting future congestion areas ...
متن کاملA new approach on indexing mobile objects on the plane
We present a set of time-efficient approaches to index objects moving on the plane to efficiently answer range queries about their future positions. Our algorithms are based on previously described solutions as well as on the employment of efficient access methods. Finally, an experimental evaluation is included that shows the performance, scalability and efficiency of our methods. 2008 Elsevie...
متن کاملIndexing Mobile Objects on the Plane
We present a method to index objects moving on the plane in order to efficiently answer range queries about their position in the future. This problem is motivated by real-life applications, like predicting future congestion areas in a highway system, or allocating more bandwidth for areas where high concetration of mobile phones is imminent. We consider the problem in the external memory model...
متن کاملAn Experimental Performance Comparison for Indexing Mobile Objects on the Plane
In this paper, the authors present a time-efficient approach to index objects moving on the plane in order to answer range queries about their future positions. Each object is moving with non small velocity u, meaning that the velocity value distribution is skewed (Zipf) towards u min in some range [ , ] u u min max , where u min is a positive lower threshold. This algorithm enhances a previous...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کامل