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
Trajectory queries and octagons in moving object databases
Proceedings of the eleventh international conference on Information and knowledge management
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Indexing Moving Objects for Trajectory Retrieval on Location-Based Services
IEICE - Transactions on Information and Systems
| Hi-index | 0.00 |
The history management of vehicles is important in telematics applications. To process queries for history data, trajectories, we generally use trajectory-preserving index schemes based on the trajectory preservation property. This property means that a leaf node only contains segments belonging to a particular trajectory, regardless of the spatiotemporal locality of segments. The sacrifice of spatiotemporal locality, however, causes the index to increase the dead space of MBBs of non-leaf nodes and the overlap between the MBBs of nodes. Therefore, an index scheme for trajectories shows good performance with trajectory-based queries, but not with coordinate-based queries, such as range queries. We propose a new index scheme that improves the performance of range queries without reducing performance with trajectory-based queries. In the new index scheme using the entry relocation strategy, two entries in different nodes are exchanged to minimize the dead spaces of the MBBs of the corresponding nodes.