参考文献
[1] Saltenis S, Jensen C S, Leutenegger S T, et al. Indexing the Positions of Continuously Moving Objects[C]//Proc. of ACM SIGMOD International Conference on Management of Data. Dallas, USA: ACM Press, 2000.
[2] Tao Yufei, Papadias D, Sun Jimeng. The TPR*-tree: An Optimized Spatio-temporal Access Method for Predictive Queries[C]//Proc. of the 29th International Conference on Vary Large Data Bases. Berlin, Germany: IEEE Press, 2003.
[3] Lin Bin, Su Jianwen. Handling Frequent Updates of Moving Objects[C]//Proc. of the 14th ACM International Conference on Information and Knowledge Management. Bremen, Germany: IEEE Press, 2005.
[4] 廖 巍, 熊 伟, 景 宁, 等. 支持频繁更新的移动对象混合索引方法[J]. 计算机研究与发展, 2006, 43(5): 888-893.
[5] 丁治明, 李肖南, 余 波. 网络受限移动对象过去、现在及将来位置的索引[J]. 软件学报, 2009, 20(12): 3193- 3204.
[6] Song M, Kitagawa H. Managing Frequent Updates in R-trees for Update-intensive Applicatons[J]. IEEE Transactions on Knowledge and Data Engineering, 2009, 21(11): 1573-1589.
[7] Chen Nan, Shou Lidan, Chen Gang, et al. Adaptive Indexing of Moving Objects with Highly Variable Update Frequencies[J]. Journal of Computer Science and Technology, 2008, 23(6): 998-1014.
[8] Fang Ying, Cao Jiaheng, Wang Junzhou, et al. HTPR*-tree: An Efficient Index for Moving Objects to Support Predictive Query and Partial History Query[C]//Proc. of the 12th International Conference on Web-age Information Management. Wuhan, China: [s. n.], 2011.
[9] 郝忠孝. 移动对象数据库理论基础[M]. 北京: 科学出版社, 2012.
[10] 于海涛, 李 梓, 姚念民. K-means聚类算法优化方法的研究[J]. 小型微型计算机系统, 2012, 33(10): 2273-2277.
[11] 李光强, 邓 敏, 程 涛, 等. 一种基于双重距离的空间聚类方法[J]. 测绘学报, 2008, 37(4): 482-488.
[12] 李新运, 郑新奇, 闫弘文. 坐标与属性一体化的空间聚类方法研究[J]. 地理与地理信息科学, 2004, 20(2): 38-40.
编辑 金胡考 |