Although significant effort has been put into the development of efficient spatio-temporal indexing techniques for moving objects, little attention has been given to the development of techniques that efficiently support queries about the past, present, and future positions of objects. The provisioning of such techniques is challenging, both because of the nature of the data, which reflects continuous movement, and because of the types of queries to be supported. This paper proposes the BBx-index structure, which indexes the positions of moving objects, given as linear functions of time, at any time. The index stores linearized moving-object locations in a forest of B+-trees. The index supports queries that select objects based on temporal and spatial constraints, such as queries that retrieve all objects whose positions fall within a spatial range during a set of time intervals. Empirical experiments are reported that offer insight into the query and update performance of the proposed technique.
|Title of host publication||Proceedings of the Sixth International Conference on Mobile Data Management|
|Publication status||Published - 2005|
|Event||International Conference on Mobile Data Management - Ayia Napa, Cyprus|
Duration: 9 May 2005 → 13 May 2005
Conference number: 6
|Conference||International Conference on Mobile Data Management|
|Period||09/05/2005 → 13/05/2005|