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
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
GBI: A Generalized R-Tree Bulk-Insertion Strategy
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
| Hi-index | 0.00 |
Indexing methods that manage current states of moving objects in a database are confronted with keeping their indexes up to date. Numerous objects that move continuously can invoke many their updates at a time constantly. R-tree based indexing methods promise to be efficient and easy to be implemented and deployed to real applications. Nevertheless, recent updating improvements for R-tree have been not either designed or appropriate to a moving object environment. Therefore, in this paper, we propose a ONCE-Updating approach applied for indexing methods developed from the R-tree. The idea is that instead of incurring the high cost of updating an indexed data on many new states at a timestamp one by one, an indexing method can easily update the data on all the states just once. In our experiments, in addition to much improving update performance, the approach even increases quality of queries extracted from indexed data. This approach can be used to support methods managing data from traffic surveillance systems.