Novel Approaches to the Indexing of Moving Object Trajectories

By D. Pfoser, Christian S. Jensen, Yannis Theodoridis. Very Large Data Bases Conference, 2000

434 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Indexing spatio-temporal trajectories with Chebyshev polynomials (2004, background): “[36] introduce the concept of trajectory-based queries, which can be further classified into topological and navigational queries.”
Nearest Neighbor Search on Moving Object Trajectories (2005, methodology): “structure such as the 3D R-tree [16], the STR-tree or the TB-tree [7].”
Trajectory Data Mining (2015, unknown): “This results in a frequent update of indexing structure and a signiﬁcant increase Though ST-R-tree and TB-tree [Pfoser et node accesses when retrieving a trajectory. al.”
The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries (2003, background): “A number of structures [CR00, PJT00, KGT+01, TP01, HKTG02] have been proposed for historical spatio-temporal databases.”
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries (2001, methodology): “The TB-tree [ PJT00 ], is a 3D R-tree based data structure where each node consists of only successive line segments of the same trajectories.”
A Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation (2021, methodology): “The first method regards the time as the third dimension and then build a 3D-Rtree, such as STR-tree and TB-tree [73].”