UTR-Tree:一种网络约束运动目标全不确定轨迹的索引结构

Zhiming Ding
{"title":"UTR-Tree:一种网络约束运动目标全不确定轨迹的索引结构","authors":"Zhiming Ding","doi":"10.1109/MDM.2008.8","DOIUrl":null,"url":null,"abstract":"The uncertainty management problem for moving objects databases has been well studied recently, with many models and algorithms proposed. However, very limited work has dealt with the index of uncertain trajectories for a running moving objects database. In this paper, we propose an index framework, the UTR- Tree, for indexing the full uncertain trajectories of network constrained moving objects. Through a dynamic index maintenance technique which is associated with location updates, the UTR-Tree can deal with the full uncertain trajectories, which include not only the historical locations of moving objects, but also their current and near future location information with uncertainty considered, so that the queries on the whole life span of the moving objects can be efficiently supported. The experimental results show that the UTR-Tree outperforms previously proposed network- based moving object index methods in dealing with full uncertain trajectories.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"UTR-Tree: An Index Structure for the Full Uncertain Trajectories of Network-Constrained Moving Objects\",\"authors\":\"Zhiming Ding\",\"doi\":\"10.1109/MDM.2008.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The uncertainty management problem for moving objects databases has been well studied recently, with many models and algorithms proposed. However, very limited work has dealt with the index of uncertain trajectories for a running moving objects database. In this paper, we propose an index framework, the UTR- Tree, for indexing the full uncertain trajectories of network constrained moving objects. Through a dynamic index maintenance technique which is associated with location updates, the UTR-Tree can deal with the full uncertain trajectories, which include not only the historical locations of moving objects, but also their current and near future location information with uncertainty considered, so that the queries on the whole life span of the moving objects can be efficiently supported. The experimental results show that the UTR-Tree outperforms previously proposed network- based moving object index methods in dealing with full uncertain trajectories.\",\"PeriodicalId\":365750,\"journal\":{\"name\":\"The Ninth International Conference on Mobile Data Management (mdm 2008)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Ninth International Conference on Mobile Data Management (mdm 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2008.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Ninth International Conference on Mobile Data Management (mdm 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2008.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

摘要

近年来,人们对运动目标数据库的不确定性管理问题进行了深入的研究,提出了许多模型和算法。然而,对于运行中的运动对象数据库的不确定轨迹索引的处理工作非常有限。在本文中,我们提出了一个索引框架,即UTR- Tree,用于索引网络约束运动对象的完整不确定轨迹。通过一种与位置更新相关联的动态索引维护技术,UTR-Tree可以处理完全不确定的轨迹,不仅包括运动对象的历史位置,还包括考虑不确定性的运动对象当前和近期的位置信息,从而有效地支持对运动对象全生命周期的查询。实验结果表明,在处理完全不确定轨迹时,该方法优于先前提出的基于网络的运动目标索引方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
UTR-Tree: An Index Structure for the Full Uncertain Trajectories of Network-Constrained Moving Objects
The uncertainty management problem for moving objects databases has been well studied recently, with many models and algorithms proposed. However, very limited work has dealt with the index of uncertain trajectories for a running moving objects database. In this paper, we propose an index framework, the UTR- Tree, for indexing the full uncertain trajectories of network constrained moving objects. Through a dynamic index maintenance technique which is associated with location updates, the UTR-Tree can deal with the full uncertain trajectories, which include not only the historical locations of moving objects, but also their current and near future location information with uncertainty considered, so that the queries on the whole life span of the moving objects can be efficiently supported. The experimental results show that the UTR-Tree outperforms previously proposed network- based moving object index methods in dealing with full uncertain trajectories.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信