中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Subject: Computer Science (provided by Thomson Reuters)
Title:
一种适合于频繁位置更新的网络受限移动对象轨迹索引
Alternative Title: an index structure for frequently updated network-constrained moving object trajectories
Author: 丁治明
Keyword: 移动对象 ; 数据库 ; 时空轨迹 ; 概略化 ; 索引
Source: 计算机学报
Issued Date: 2012
Volume: 35, Issue:7, Pages:1448-1461
Indexed Type: CNKI ; EI ; CSCD ; WANFANG
Department: 中国科学院软件研究所基础软件国家工程研究中心;
Sponsorship: 国家自然科学基金项目(91124001,60970030)资助
Abstract: 移动对象索引是支持海量移动对象管理的一项关键技术.目前的移动对象时空轨迹索引方法如STR-Tree、TB-Tree、FNR-Tree、MON-Tree等均直接以轨迹单元作为基本的索引记录单位,在位置更新时需要频繁地在索引中插入新的记录,从而严重地影响了数据库的总体性能.为了解决上述问题,文中提出一种网络受限移动对象的动态概略化轨迹R树索引(DSTR-Tree).DSTR-Tree将索引空间划分成等距格栅,并通过格栅单元对每一条移动对象轨迹进行概略化,然后以概略化轨迹单元为基本索引记录单位建立R树索引.由于概略化轨迹的粒度大大粗于原始轨迹,因此移动对象不需要在每次位置更新的同时触发索引更新,而仅需要在轨迹跨越当前格栅单元时才进行索引更新,从而显著地降低了索引更新的代价.实验结果表明,DSTR-Tree在移动对象数据库频繁位置更新的实际运行条件下,提供了良好的索引维护及总体查询处理性能.
English Abstract: Index is a key technology to improve the query processing performance of moving objects databases. However, current index methods for moving object trajectories, such as STR-Tree, TB-Tree, FNR-Tree, and MON-Tree, take trajectory units as the basic index records, and therefore, frequent insertions are needed when location updates occur in order to keep the consistency between the index and the trajectories in database, which greatly affects the overall performance of moving objects databases. To solve this problem, we propose a new index method, Dynamic Sketched-Trajectory R-Tree for Network-constrained Moving Objects (DSTR-Tree) in this paper. The DSTR-Tree divides the spatial-temporal space into equal-sized grid cells, transforms every trajectory into a sketched trajectory with each unit connecting two centers of the grid cells that the moving object travels through, and indices the sketched trajectory units as an R-Tree. Since the sketched trajectory has much coarser granularity than the original trajectory, the index updating cost can be greatly reduced - when a location update occurs, even though the original trajectory needs to be changed, the sketched trajectory may remain unchanged so that the DSTR-Tree does not need to be changed either. The experimental results show that the DSTR-Tree outperforms the previously proposed trajectory index methods in running moving objects databases with frequent location updates.
Language: 中文
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15005
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
丁治明. 一种适合于频繁位置更新的网络受限移动对象轨迹索引[J]. 计算机学报,2012-01-01,35(7):1448-1461.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[丁治明]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[丁治明]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace