Theory of linear and integer programming
Theory of linear and integer programming
The input/output complexity of sorting and related problems
Communications of the ACM
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
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Database system issues in nomadic computing
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Processing queries by linear constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth 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
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth 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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Parametric Rectangles: A Model for Querying and Animation of Spatiotemporal Databases
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Clustering moving objects for spatio-temporal selectivity estimation
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
An Indexing Method for Answering Queries on Moving Objects
Distributed and Parallel Databases
Proceedings of the 6th international conference on Mobile data management
Primal or dual: which promises faster spatiotemporal search?
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
We consider the problem of indexing a set of objects moving in d-dimensional space along linear trajectories. A simple disk-based indexing scheme is proposed to efficiently answer queries of the form: report all objects that will pass between two given points within a specified time interval. Our scheme is based on mapping the objects to a dual space, where queries about moving objects translate into polyhedral queries concerning their speeds and initial locations. We then present a simple method for answering such polyhedral queries, based on partitioning the space into disjoint regions and using a B-tree to index the points in each region. By appropriately selecting the boundaries of each region, we can guarantee an average search time that almost matches a known lower bound for the problem. Specifically, for a fixed d, if the coordinates of a given set of N points are statistically independent, the proposed technique answers polyhedral queries, on the average, in O((N/B)1 - 1/d 驴 (logB N)1/d + K/B) I/O's using O(N/B) space, where B is the block size, and K is the number of reported points. Our approach is novel in that, while it provides a theoretical upper bound on the average query time, it avoids the use of complicated data structures, making it an effective candidate for practical applications.