New upper bounds for neighbor searching
Information and Control
Halfspace range search: an algorithmic application of k-sets
Discrete & Computational Geometry
Filtering search: a new approach to query answering
SIAM Journal on Computing
Proceedings of the sixteenth international conference on Very large databases
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
Processing queries by linear constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On two-dimensional indexability and optimal range search indexing
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
A foundation for representing and querying moving objects
ACM Transactions on Database Systems (TODS)
Efficient searching with linear constraints
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Cost and Imprecision in Modeling the Position of Moving Objects
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Hi-index | 0.00 |
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 in a highway Geographic Information System (GIS). We consider the problem in the external memory model of computation and present a variety of dynamic techniques.