[1] NISHIMURA S, DAS S, AGRAWAL D, et al. MD-HBase:a scalable multi-dimensional data infrastructure for location aware services[C]//Proceedings of the 2011 IEEE 12th International Conference on Mobile Data Management. Piscataway, NJ:IEEE, 2011:7-16. [2] CHEN X Y, ZHANG C, GE B, et al. Spatio-temporal queries in HBase[C]//Proceedings of the 2015 IEEE International Conference on Big Data. Piscataway, NJ:IEEE, 2015:1929-1937. [3] KOTHURI R K V, RAVADA S, ABUGOV D. Quadtree and R-tree indexes in oracle spatial:a comparison using GIS data[C]//Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data. New York:ACM, 2002:546-557. [4] OOI B C, MCDONELL K J, SACKS-DAVIS R. Spatial kd-tree:an indexing mechanism for spatial databases[C]//Proceedings of the 1987 IEEE Computer Software and Applications Conference. Piscataway, NJ:IEEE, 1987:433-438. [5] de ALMEIDA V T, GVTING R H. Indexing the trajectories of moving objects in networks[J]. Geoinformatica, 2005, 9(1):33-60. [6] VORA M N. Hadoop-HBase for large-scale data[C]//Proceedings of the 2011 International Conference on Computer Science and Network Technology. Piscataway, NJ:IEEE, 2011:601-605. [7] DU N B, ZHAN J F, ZHAO M, et al. Spatio-temporal data index model of moving objects on fixed networks using HBase[C]//Proceedings of the 2015 IEEE International Conference on Computational Intelligence & Communication Technology. Piscataway, NJ:IEEE, 2015:247-251. [8] van HONG L, TAKASU A. A scalable spatio-temporal data storage for intelligent transportation systems based on HBase[C]//Proceedings of the 2015 IEEE 18th International Conference on Intelligent Transportation Systems. Piscataway, NJ:IEEE, 2015:2733-2738. [9] 李萍萍.时空数据库中高维数据的降维方法[D]. 哈尔滨: 哈尔滨理工大学,2009:7-18.(LI P P. Dimensionality reduction of higher dimensional data in spatio-temporal databases [D]. Harbin: Harbin University of Science and Technology, 2009: 7-18.) [10] KARYPIS G, KUMAR V. Analysis of multilevel graph partitioning [C]// Proceedings of the 1995 ACM/IEEE Conference on Supercomputing. New York: ACM, 1995: Article No. 29. [11] ZHONG R C, LI G L, TAN K-L, et al. G-Tree: an efficient and scalable index for spatial search on road networks [J]. IEEE Transactions on Knowledge & Data Engineering, 2015, 27(8): 2175-2189. [12] SAHU P K, MANNA K, SHAH N, et al. Extending Kernighan-Lin partitioning heuristic for application mapping onto Network-on-Chip [J]. Journal of Systems Architecture, 2014, 60(7): 562-578. [13] DVNTGEN C, BEHR T, GVTING R H. BerlinMOD: a benchmark for moving object databases [J]. VLDB Journal, 2009, 18(6): 1335-1368. [14] KOMAI Y, NGUYEN D H, HARA T, et al. KNN search utilizing index of the minimum road travel time in time-dependent road networks [C]// Proceedings of the 2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops. Piscataway, NJ: IEEE, 2014: 131-137. [15] KE S N, GONG J, LI S N, et al. A hybrid spatio-temporal data indexing method for trajectory databases [J]. Sensors, 2014, 14(7): 12990-13005. |