A Flexible Spatio-Temporal Indexing Scheme for Large-Scale GPS Track Retrieval

Longhao Wang, Yu Zheng, Xing Xie, Wei-Ying Ma
{"title":"A Flexible Spatio-Temporal Indexing Scheme for Large-Scale GPS Track Retrieval","authors":"Longhao Wang, Yu Zheng, Xing Xie, Wei-Ying Ma","doi":"10.1109/MDM.2008.24","DOIUrl":null,"url":null,"abstract":"The increasing popularity of GPS device has boosted many Web applications where people can upload, browse and exchange their GPS tracks. In these applications, spatial or temporal search function could provide an effective way for users to retrieve specific GPS tracks they are interested in. However, existing spatial-temporal index for trajectory data has not exploited the characteristic of user behavior in these online GPS track sharing applications. In most cases, when sharing a GPS track, people are more likely to upload GPS data of the near past than the distant past. Thus, the interval between the end time of a GPS track and the time it is uploaded, if viewed as a random variable, has a skewed distribution. In this paper, we first propose a probabilistic model to simulate user behavior of uploading GPS tracks onto an online sharing application. Then we propose a flexible spatio-temporal index scheme, referred to as Compressed Start-End Tree (CSE-tree), for large-scale GPS track retrieval. The CSE-tree combines the advantages of B+ Tree and dynamic array, and maintains different index structure for data with different update frequency. Experiments using synthetic data show that CSE-tree outperforms other schemes in requiring less index size and less update cost while keeping satisfactory retrieval performance.","PeriodicalId":365750,"journal":{"name":"The Ninth International Conference on Mobile Data Management (mdm 2008)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"67","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.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 67

Abstract

The increasing popularity of GPS device has boosted many Web applications where people can upload, browse and exchange their GPS tracks. In these applications, spatial or temporal search function could provide an effective way for users to retrieve specific GPS tracks they are interested in. However, existing spatial-temporal index for trajectory data has not exploited the characteristic of user behavior in these online GPS track sharing applications. In most cases, when sharing a GPS track, people are more likely to upload GPS data of the near past than the distant past. Thus, the interval between the end time of a GPS track and the time it is uploaded, if viewed as a random variable, has a skewed distribution. In this paper, we first propose a probabilistic model to simulate user behavior of uploading GPS tracks onto an online sharing application. Then we propose a flexible spatio-temporal index scheme, referred to as Compressed Start-End Tree (CSE-tree), for large-scale GPS track retrieval. The CSE-tree combines the advantages of B+ Tree and dynamic array, and maintains different index structure for data with different update frequency. Experiments using synthetic data show that CSE-tree outperforms other schemes in requiring less index size and less update cost while keeping satisfactory retrieval performance.
面向大规模GPS航迹检索的灵活时空标引方案
GPS设备的日益普及推动了许多网络应用程序的发展,人们可以上传、浏览和交换他们的GPS轨迹。在这些应用中,空间或时间搜索功能可以为用户检索他们感兴趣的特定GPS轨迹提供有效的方法。然而,现有的轨迹数据时空索引并没有充分利用在线GPS轨迹共享应用的用户行为特征。在大多数情况下,当分享GPS轨迹时,人们更有可能上传最近的GPS数据,而不是遥远的过去。因此,如果将GPS跟踪结束时间和上传时间之间的间隔视为随机变量,则具有倾斜分布。在本文中,我们首先提出了一个概率模型来模拟用户上传GPS轨迹到在线共享应用程序的行为。然后,我们提出了一种灵活的时空索引方案,即压缩起始-结束树(CSE-tree),用于大规模GPS航迹检索。CSE-tree结合了B+ Tree和动态数组的优点,对不同更新频率的数据保持不同的索引结构。基于合成数据的实验表明,cse树在保持满意的检索性能的同时,需要更少的索引大小和更少的更新成本,优于其他方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信