The Vantage Index: Executing Distance Queries at Scale

Giannis Evagorou, M. Lavalle, T. Heinis
{"title":"The Vantage Index: Executing Distance Queries at Scale","authors":"Giannis Evagorou, M. Lavalle, T. Heinis","doi":"10.1145/3400903.3400933","DOIUrl":null,"url":null,"abstract":"Due to the proliferation of GPS-enabled devices, vast amounts of trajectory datasets are being collected every day. Analyzing this data efficiently and at scale is a major challenge. Several different types of spatio-temporal queries are used to analyze these datasets. One important query is the distance query on trajectory data which, given a query distance D, a point P and a time span T, finds all trajectories within D of P during T. This query is frequently used in traffic analysis and numerous other applications. In this paper we develop the means to efficiently and scalably analyse large amounts of trajectory data with the distance query. To this end we develop the means to distribute the trajectory data in a distributed infrastructure (Spark) as well as the index needed on the nodes to answer the query locally. As our experiments show, our approach is more efficient when compared to a baseline method.","PeriodicalId":334018,"journal":{"name":"32nd International Conference on Scientific and Statistical Database Management","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"32nd International Conference on Scientific and Statistical Database Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3400903.3400933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the proliferation of GPS-enabled devices, vast amounts of trajectory datasets are being collected every day. Analyzing this data efficiently and at scale is a major challenge. Several different types of spatio-temporal queries are used to analyze these datasets. One important query is the distance query on trajectory data which, given a query distance D, a point P and a time span T, finds all trajectories within D of P during T. This query is frequently used in traffic analysis and numerous other applications. In this paper we develop the means to efficiently and scalably analyse large amounts of trajectory data with the distance query. To this end we develop the means to distribute the trajectory data in a distributed infrastructure (Spark) as well as the index needed on the nodes to answer the query locally. As our experiments show, our approach is more efficient when compared to a baseline method.
优势索引:大规模执行距离查询
由于gps设备的普及,每天都在收集大量的轨迹数据集。有效且大规模地分析这些数据是一项重大挑战。几种不同类型的时空查询用于分析这些数据集。其中一个重要的查询是对轨迹数据的距离查询,给定查询距离D、点P和时间跨度T,可以找到T期间P (D)内的所有轨迹。这种查询经常用于交通分析和许多其他应用。本文提出了一种利用距离查询对大量弹道数据进行高效、可扩展分析的方法。为此,我们开发了在分布式基础设施(Spark)中分布轨迹数据的方法,以及在节点上响应本地查询所需的索引。正如我们的实验所表明的,与基线方法相比,我们的方法更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信