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

基于网格分组移动对象的索引方法
引用本文:梁野,龚雪晶,慈林林.基于网格分组移动对象的索引方法[J].北京理工大学学报,2008,28(8):692-696.
作者姓名:梁野  龚雪晶  慈林林
作者单位:北京理工大学,计算机科学技术学院,北京,100081;北京理工大学,计算机科学技术学院,北京,100081;北京理工大学,计算机科学技术学院,北京,100081
摘    要:针对目前使用广泛的移动对象索引技术对受限范围内的海量数据索引管理问题.引入了网格技术实现移动对象的分组管理,提出了基于网格分组的移动对象GG TPR树索引方法.该方法利用网格分组的方式,将位置与运动行为接近的移动对象进行整体维护和批量管理,从而减少索引维护的中间环节,提高移动对象的索引效率.模拟实验结果表明,利用GG TPR树索引受限范围内的海量数据较已有的移动对象索引方法性能更优.

关 键 词:移动对象  网格分组  TPR树  索引算法
收稿时间:2008/1/24 0:00:00

An Indexing Method for Grouping Moving Objects with Grid
LIANG Ye,GONG Xue-jing and CI Lin-lin.An Indexing Method for Grouping Moving Objects with Grid[J].Journal of Beijing Institute of Technology(Natural Science Edition),2008,28(8):692-696.
Authors:LIANG Ye  GONG Xue-jing and CI Lin-lin
Institution:School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China;School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China;School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
Abstract:TPR-tree is the most popular indexing method for moving objects,but it is inefficient to deal with a huge number of moving objects within a limited area.When taking cognizance of the regular track of moving objects within a limited area,the grid technique can be relied upon to group the moving objects.With the GG TPR-tree,grouped moving objects which are neighbors and will run to the same direction in the future to improve the efficiency in indexing.Experimental results showed that GG TPR-tree's performance was better than the other indexing structure on managing a great number of moving objects within a limited area.
Keywords:moving objects  grid  TPR-tree  indexing algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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