SMaRT: A novel framework for addressing range queries over nonlinear trajectories

Agarwal, 2000, Indexing moving points (extended abstract), 175 Agarwal, 2000, Efficient searching with linear constraints, J. Comput. Syst. Sci., 61, 194, 10.1006/jcss.2000.1709 Beckmann, 1990, The R*-tree: An efficient and robust access method for points and rectangles, 322 Gaede, 1998, Multidimensional access methods, ACM Comput. Surv., 30, 170, 10.1145/280277.280279 Goldstein, 1997, Processing queries by linear constraints, 257 Kollios, 1999, On indexing mobile objects, 261 Kollios, 2005, Indexing mobile objects using dual transformations, VLDB J., 14, 238, 10.1007/s00778-004-0139-z Manolopoulos, 2000 Papadopoulos, 2002, Indexing mobile objects on the plane, 693 Patel, 2004, STRIPES: An efficient index for predicted trajectories, 635 Raptopoulou, 2004, Towards quadtree-based moving objects databases, 230 Raptopoulou, 2006, Efficient processing of past-future spatiotemporal queries, 68 Raptopoulou, 2006, On past-time indexing of moving objects, J. Syst. Softw., 79, 1079, 10.1016/j.jss.2005.10.020 Saltenis, 2002, Indexing of moving objects for location-based services, 463 Saltenis, 2000, Indexing the positions of continuously moving objects, 331 Salzberg, 1999, Comparison of access methods for time-evolving data, ACM Comput. Surv., 31, 158, 10.1145/319806.319816 Sioutas, 2008, A new approach on indexing mobile objects on the plane, Data Knowl. Eng., 67, 362, 10.1016/j.datak.2008.06.009 Snyder, 1987 Tao, 2003, The TPR*-tree: An optimized spatio-temporal access method for predictive queries, 790 Zheng, 2009, Mining interesting locations and travel sequences from gps trajectories, 791