首页 | 本学科首页   官方微博 | 高级检索  
     

基于MongoDB的轨迹大数据时空索引构建方法
引用本文:王凯,陈能成,陈泽强.基于MongoDB的轨迹大数据时空索引构建方法[J].计算机系统应用,2017,26(6):227-231.
作者姓名:王凯  陈能成  陈泽强
作者单位:武汉大学 测绘遥感信息工程国家重点实验室, 武汉 430079,武汉大学 测绘遥感信息工程国家重点实验室, 武汉 430079,武汉大学 测绘遥感信息工程国家重点实验室, 武汉 430079
基金项目:国家自然科学基金(41301441);中国博士后基金(2014M562050,2015T80829)
摘    要:近年来,随着计算机技术与无线传感器网络的发展,轨迹大数据越来越得到人们的关注.针对海量轨迹数据在存储与查询中出现的效率问题,文章基于文档型非关系型数据库MongoDB提出了一套基于四叉树的道路网时空索引,实现海量轨迹数据的高效查询.通过对太原市1915辆出租车的50万条轨迹数据进行时空查询,在不同数据量与不同并发数下测试道路网时空索引与MongoDB复合时空索引的效率表现.实验结果显示道路网时空索引在数据量大于10万时有较好表现,并能够适应不同并发数下的时空查询,验证了道路网时空索引构建方法的可行性和高效性.

关 键 词:非关系型数据库  四叉树  时空索引  轨迹数据
收稿时间:2016/9/7 0:00:00
修稿时间:2016/10/19 0:00:00

Spatio-Temporal Indexing Method of Big Trajectory Data Based on MongoDB
WANG Kai,CHEN Neng-Cheng and CHEN Ze-Qiang.Spatio-Temporal Indexing Method of Big Trajectory Data Based on MongoDB[J].Computer Systems& Applications,2017,26(6):227-231.
Authors:WANG Kai  CHEN Neng-Cheng and CHEN Ze-Qiang
Affiliation:State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430079, China,State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430079, China and State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430079, China
Abstract:In recent years, with the vigorous development of computer science and wireless sensor network, how to address big trajectory data is becoming a concerned issue increasingly. Because of massive trajectory data, there is an increasing focus on storage and search of big trajectory data. In view of this, based on the document type non relational database MongoDB, we propose a spatio-temporal index of road network which is based on quad-tree. For the 1915 taxis in Taiyuan, the 500,000 pieces of trajectory data are searched. With different data and different number of concurrency, we compare the efficiency of spatio-temporal index with that of MongoDB composite spatio-temporal index. Experimental results show that our method performs well when data volume is larger than 100000. It can adapt to spatio-temporal queries with different number of concurrency, proving that the method is feasible and efficient.
Keywords:NoSQL database  quad-tree  spatio-temporal index  trajectory data
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号