Indexing the positions of continuously moving objects
Top Cited Papers
- 16 May 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 29 (2) , 331-342
- https://doi.org/10.1145/335191.335427
Abstract
The coming years will witness dramatic advances in wireless communications as well as positioning technologies. As a result, tracking the changing positions of objects capable of continuous movement is becoming increasingly feasible and necessary. The present paper proposes a novel, R*-tree based indexing technique that supports the efficient querying of the current and projected future positions of such moving objects. The technique is capable of indexing objects moving in one-, two-, and three-dimensional space. Update algorithms enable the index to accommodate a dynamic data set, where objects may appear and disappear, and where changes occur in the anticipated positions of existing objects. A comprehensive performance study is reported.Keywords
This publication has 13 references indexed in Scilit:
- Indexing moving points (extended abstract)Published by Association for Computing Machinery (ACM) ,2000
- On two-dimensional indexability and optimal range search indexingPublished by Association for Computing Machinery (ACM) ,1999
- On indexing mobile objectsPublished by Association for Computing Machinery (ACM) ,1999
- Efficient searching with linear constraintsPublished by Association for Computing Machinery (ACM) ,1998
- Designing access methods for bitemporal databasesIEEE Transactions on Knowledge and Data Engineering, 1998
- Processing queries by linear constraintsPublished by Association for Computing Machinery (ACM) ,1997
- An asymptotically optimal multiversion B-treeThe VLDB Journal, 1996
- On packing R-treesPublished by Association for Computing Machinery (ACM) ,1993
- A dual approach to detect polyhedral intersections in arbitrary dimensionsBIT Numerical Mathematics, 1991
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990