参考文献
[1]EldawyA,Mokbel N F.Spatialhadoop:A Mapreduce Framework for Spatial Data[C]//Proceedings of ICDE’15.Washington D.C.,USA:IEEE Press,2015:215-226.
[2]Apache Spark Project[EB/OL].(2015-01-21).http://spark.apache.org.
[3]Zaharia M,Chowdhury M,Das T,et al.Resilient Distributed Datasets:A Fault-tolerant Abstraction for In-memory Cluster Computing[C]//Proceedings of NSDI’12.Washington D.C.,USA:IEEE Press,2012:214-223.
[4]Armbrust M,Xin R S,Lian C,et al.Spark SQL:Relational Data Processing in Spark[C]//Proceedings of SIGMOD’15.Washington D.C.,USA:IEEE Press,2015:365-376.
[5]Dong Xie,Li Feifei,Yao Bin,et al.Simba:Efficient In-memory Spatial Analytics[C]//Proceedings of SIGMOD’16.Washington D.C.,USA:IEEE Press,2016:23-36.
[6]Tao Y,Papadias D.Time-parameterized Queries in Spatio-temporal Databases[C]//Proceedings of 2002 ACM SIGMOD International Conference on Management of Data.New York,USA:ACM Press,2002:334-345.
[7]Mokbel M F,Xiong X,Aref W G.Sina:Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases[C]//Proceedings of 2004 ACM SIGMOD International Conference on Management of Data.New York,USA:ACM Press,2004:623-634.
[8]于海彦.时空数据库中移动对象轨迹查询方法研究[D].哈尔滨:哈尔滨理工大学,2007.
[9]Apache Hadoop Project[EB/OL].(2015-10-21).http://hadoop.apache.org.
[10]Dean J,Ghemawat S.Mapreduce:Simplified Data Processing on Large Clusters[C]//Proceedings of OSDI’04.Washington D.C.,USA:IEEE Press,2004:265-276.
[11]Tan H,Luo W,Ni L M.Clost:A Hadoop-based Storage System for Big Spatio-temporal Data Analytics[C]//Proceedings of the 21st ACM International Conference on Information and Knowledge Management.New York,USA:ACM Press,2012:2139-2143.
(下转第37页)
(上接第28页)
[12]左亚尧,封朝永,陈磊.基于Hadoop的时态信息存储与时态关系演算问题研究[J].计算机应用研究,2014,31(5):1390-1395.
[13]Zhong Y,Zhu X,Fang J.Elastic and Effective Spatio-temporal Query Processing Scheme on Hadoop[C]//Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data.New York,USA:ACM Press,2012:33-42.
[14]Blankenagel G,Güting R H.External Segment Trees[J].Algorithmica,1994,12(6):498-532.
[15]Elmasri R,Wuu G T,Kim Y J.The Time Index:An Access Structure for Temporal Data[C]//Proceedings of the 16th International Conference on Very Large Data Bases.[S.1.]:Morgan Kaufmann Publishers Inc.,1990:1-12.
[16]Becker B,Gschwind S,Ohler T,et al.An Asymptotically Optimal Multiversion B-tree[J].International Journal on Very Large Data Bases,1996,5(4):264-275.
[17]Gunadhi H,Segev A.Efficient Indexing Methods for Temporal Relations[J].IEEE Transactions on Knowledge and Data Engineering,1993,5(3):496-509.
[18]Tsotras V J,Kangelaris N.The Snapshot Index:An I/O-optimal Access Method for Timeslice Queries[J].Information Systems,1995,20(3):237-260.
[19]Nascimento M A,Silva J R.Towards Historical R-trees[C]//Proceedings of 1998 ACM Symposium on Applied Computing.New York,USA:ACM Press,1998:235-240.
[20]Edelsbrunner H.A New Approach to Rectangle Intersections Part[J].International Journal of Computer Mathematics,1983,13(3/4):209-219.
编辑索书志 |