Benjamin B. Krogh, O. Andersen, Edwin Lewis-Kelham, K. Torp
{"title":"Efficient one-click browsing of large trajectory sets","authors":"Benjamin B. Krogh, O. Andersen, Edwin Lewis-Kelham, K. Torp","doi":"10.1145/2666310.2666371","DOIUrl":null,"url":null,"abstract":"Traffic researchers, planners, and analysts want a simple way to query the large quantities of GPS trajectories collected from vehicles. In addition, users expect the results to be presented immediately even when querying very large transportation networks with huge trajectory data sets. This paper presents a novel query type called sheaf, where users can browse trajectory data sets using a single mouse click. Sheaves are very versatile and can be used for location-based advertising, travel-time analysis, intersection analysis, and reachability analysis (isochrones). A novel in-memory trajectory index compresses the data by a factor of 12.4 and enables execution of sheaf queries in 40 ms. This is up to 2 orders of magnitude faster than existing work. We demonstrate the simplicity, versatility, and efficiency of sheaf queries using a real-world trajectory set consisting of 2.7 million trajectories (1.36 billion GPS records) and a network with 1.5 million edges.","PeriodicalId":153031,"journal":{"name":"Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2666310.2666371","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Traffic researchers, planners, and analysts want a simple way to query the large quantities of GPS trajectories collected from vehicles. In addition, users expect the results to be presented immediately even when querying very large transportation networks with huge trajectory data sets. This paper presents a novel query type called sheaf, where users can browse trajectory data sets using a single mouse click. Sheaves are very versatile and can be used for location-based advertising, travel-time analysis, intersection analysis, and reachability analysis (isochrones). A novel in-memory trajectory index compresses the data by a factor of 12.4 and enables execution of sheaf queries in 40 ms. This is up to 2 orders of magnitude faster than existing work. We demonstrate the simplicity, versatility, and efficiency of sheaf queries using a real-world trajectory set consisting of 2.7 million trajectories (1.36 billion GPS records) and a network with 1.5 million edges.