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

大规模轨迹数据的Geohash编码组织及高效范围查询
引用本文:向隆刚,王德浩,龚健雅.大规模轨迹数据的Geohash编码组织及高效范围查询[J].武汉大学学报(信息科学版),2017,42(1):21-27.
作者姓名:向隆刚  王德浩  龚健雅
作者单位:1.武汉大学测绘遥感信息工程国家重点实验室, 湖北 武汉, 430079
基金项目:国家自然科学基金41471374国家自然科学基金41001296
摘    要:面向成熟的关系-对象型空间数据库,利用Geohash编码的唯一性、一维性和递归性等特征,提出了一种基于Geohash编码的大规模轨迹数据组织方法及范围查询技术。该方法结合Geohash编码和B+树索引,设计了适应不同尺度范围查询的大规模轨迹数据的关系组织模式,并给出了相应的两阶段查询处理算法,同时提出了一种Z合并优化,以进一步提高范围查询的处理效率。实验结果表明,此方法适合于组织管理与查询分析大规模的轨迹数据,其范围查询性能高于内置的R树索引。

关 键 词:轨迹数据    Geohash编码    范围查询    Z合并优化
收稿时间:2015-09-07

Organization and Efficient Range Query of Large Trajectory Data Based on Geohash
Institution:1.State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan 430079, China
Abstract:Efficient organization and querying of trajectory data is one of the research hotspots in spatial database field. By taking advantage of the properties of globally unique, one-dimension and hierarchically recursive coding of Geohash codes, oriented to relational spatial database, we proposes a Geohash-baesd organization method of large trajectory data and its range query processing technology. First, a trajectory relational schema, which combines Geohash coding and B+ tree index, is designed for range queries at multiple scales. Then, a corresponding two-stage range query processing algorithm is introduced. Next, we come up with Z-merge optimization for further improving the efficiency of range query processing. Finally, the experiment results based on Oracle11g verify that our approach is fit for organizing large trajectory data and its range query performance is much better than traditional R-tree.
Keywords:
本文献已被 CNKI 等数据库收录!
点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息
点击此处可从《武汉大学学报(信息科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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