Cost evaluation and improvement of TB-tree insertion algorithm

[1]  Ralf Hartmut Güting,et al.  Moving Objects Databases , 2005 .

[2]  Frank Dürr,et al.  Scalable processing of trajectory-based queries in space-partitioned moving objects databases , 2008, GIS '08.

[3]  Roberto Tamassia,et al.  Continuous probabilistic nearest-neighbor queries for uncertain trajectories , 2009, EDBT '09.

[4]  Chinya V. Ravishankar,et al.  PA-Tree: A Parametric Indexing Scheme for Spatio-temporal Trajectories , 2005, SSTD.

[5]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[6]  Walid G. Aref,et al.  Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects , 2002, IEEE Trans. Computers.

[7]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[8]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[9]  Jeffrey Xu Yu,et al.  Spatial Range Querying for Gaussian-Based Imprecise Query Objects , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[10]  Nikos Pelekis,et al.  Algorithms for Nearest Neighbor Search on Moving Object Trajectories , 2007, GeoInformatica.

[11]  Minyi Guo,et al.  Probabilistic Range Query over Uncertain Moving Objects in Constrained Two-Dimensional Space , 2012, IEEE Transactions on Knowledge and Data Engineering.

[12]  Ralf Hartmut Güting,et al.  Efficient k-nearest neighbor search on moving object trajectories , 2010, The VLDB Journal.

[13]  Timos K. Sellis,et al.  Probabilistic Range Monitoring of Streaming Uncertain Positions in GeoSocial Networks , 2012, SSDBM.

[14]  Keun Ho Ryu,et al.  Indexing for Efficient Managing Current and Past Trajectory of Moving Object , 2004, APWeb.

[15]  Jianjun Li,et al.  Continuous reverse k nearest neighbor monitoring on moving objects in road networks , 2010, Inf. Syst..

[16]  Kai Zheng,et al.  Probabilistic range queries for uncertain trajectories on road networks , 2011, EDBT/ICDT '11.

[17]  Jignesh M. Patel,et al.  Indexing Large Trajectory Data Sets With SETI , 2003, CIDR.

[18]  Christian S. Jensen,et al.  Nearest neighbor and reverse nearest neighbor queries for moving objects , 2002, Proceedings International Database Engineering and Applications Symposium.

[19]  Chao-Chun Yeh,et al.  A Cloud-Based Trajectory Index Scheme , 2009, 2009 IEEE International Conference on e-Business Engineering.

[20]  Jimeng Sun,et al.  The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.

[21]  Yunjun Gao,et al.  Efficient k-Nearest-Neighbor Search Algorithms for Historical Moving Object Trajectories , 2007, Journal of Computer Science and Technology.

[22]  Dieter Pfoser,et al.  Novel Approaches to the Indexing of Moving Object Trajectories , 2000, VLDB.

[23]  Zheping Shao,et al.  Spatial Temporal Index-based Historic Closing Event Query or Moving Objects , 2013 .

[24]  Zhanting Yuan,et al.  The GPS trajectory data research based on the intelligent traffic big data analysis platform , 2017, J. Comput. Methods Sci. Eng..

[25]  Kotagiri Ramamohanarao,et al.  Recursive partitioning method for trajectory indexing , 2010, ADC.

[26]  Jignesh M. Patel,et al.  STRIPES: an efficient index for predicted trajectories , 2004, SIGMOD '04.

[27]  Timos K. Sellis,et al.  Efficient Cost Models for Spatial Queries Using R-Trees , 2000, IEEE Trans. Knowl. Data Eng..

[28]  Jian Pei,et al.  Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data , 2010, IEEE Transactions on Knowledge and Data Engineering.

[29]  Divyakant Agrawal,et al.  Storage and Retrieval of Moving Objects , 2001, Mobile Data Management.

[30]  Christian S. Jensen,et al.  Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD Conference.