The self-relocating index scheme for telematics GIS

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 spatiotcmporal 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 trajectorybased 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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Lim, D., Hong, B., & Cho, D. (2006). The self-relocating index scheme for telematics GIS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3833 LNCS, pp. 93–103). https://doi.org/10.1007/11599289_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free