This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations
May 2007 (vol. 19 no. 5)
pp. 663-678
Complex queries on trajectory data are increasingly common in applications involving moving objects. MBR or grid-cell approximations on trajectories perform suboptimally since they do not capture the smoothness and lack of internal area of trajectories. We describe a parametric space indexing method for historical trajectory data, approximating a sequence of movement functions with single continuous polynomial. Our approach works well, yielding much finer approximation quality than MBRs. We present the PA-tree, a parametric index that uses this method, and show through extensive experiments that PA-trees have excellent performance for offline and online spatio-temporal range queries. Compared to MVR-trees, PA-trees are an order of magnitude faster to construct and incur I/O cost for spatio-temporal range queries lower by a factor of 2-4. SETI is faster than our method for index construction and timestamp queries, but incurs twice the I/O cost for time interval queries, which are much more expensive and are the bottleneck in online processing. Therefore, the PA-tree is an excellent choice for both offline and online processing of historical trajectories.
Index Terms:
Access methods, spatio-temporal databases.
Citation:
Jinfeng Ni, Chinya V. Ravishankar, "Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations," IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 5, pp. 663-678, May 2007, doi:10.1109/TKDE.2007.1006
Usage of this product signifies your acceptance of the Terms of Use.