Fast transportation network traversal with hyperedges: (industrial paper)

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2016-10-31 DOI:10.1145/2996913.2996991

P. Bakalov, E. Hoel, Wee-Liang Heng

{"title":"Fast transportation network traversal with hyperedges: (industrial paper)","authors":"P. Bakalov, E. Hoel, Wee-Liang Heng","doi":"10.1145/2996913.2996991","DOIUrl":null,"url":null,"abstract":"Network data models are frequently used as a mechanism to solve wide range of problems typical for the GIS applications and transportation planning in particular. Because of their popularity and efficiency those models tend to grow in size and complexity. This growth however creates multiple scalability issues caused by the large number of network elements that have to be examined during the network traversal. In this paper we present an extension of our network model tailored towards improving the performance of hierarchical point to point solve operations. The proposed solution is based on introducing a new network edge type that we term hyperedges. We describe how hyperedges can be specified with a re-interpretation of our existing any-vertex connectivity policy on edges, discusses some modeling issues, and also provide insights of our implementation experience and the impact which those novel network elements have on the solve performance. Our solution is based on the existing database functionality (tables, joins, sorting algorithms) provided by a standard relational DBMS and has been implemented and tested and currently being shipped as a part of the ESRI ArcGIS 10.1 platform and all subsequent releases.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":"12 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2996913.2996991","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Network data models are frequently used as a mechanism to solve wide range of problems typical for the GIS applications and transportation planning in particular. Because of their popularity and efficiency those models tend to grow in size and complexity. This growth however creates multiple scalability issues caused by the large number of network elements that have to be examined during the network traversal. In this paper we present an extension of our network model tailored towards improving the performance of hierarchical point to point solve operations. The proposed solution is based on introducing a new network edge type that we term hyperedges. We describe how hyperedges can be specified with a re-interpretation of our existing any-vertex connectivity policy on edges, discusses some modeling issues, and also provide insights of our implementation experience and the impact which those novel network elements have on the solve performance. Our solution is based on the existing database functionality (tables, joins, sorting algorithms) provided by a standard relational DBMS and has been implemented and tested and currently being shipped as a part of the ESRI ArcGIS 10.1 platform and all subsequent releases.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

具有超边缘的快速运输网络遍历:(工业用纸)

网络数据模型经常被用作一种机制来解决地理信息系统应用和交通规划中的各种典型问题。由于它们的普及和效率，这些模型的规模和复杂性趋于增长。然而，这种增长产生了多个可伸缩性问题，这是由于在网络遍历期间必须检查大量网络元素所导致的。在本文中，我们提出了针对改进分层点对点求解操作性能的网络模型的扩展。提出的解决方案是基于引入一种新的网络边缘类型，我们称之为超边缘。我们描述了如何通过重新解释现有的任意顶点连接策略来指定超边缘，讨论了一些建模问题，并提供了我们的实现经验和这些新网络元素对求解性能的影响的见解。我们的解决方案基于标准关系DBMS提供的现有数据库功能(表、连接、排序算法)，并已被实现和测试，目前作为ESRI ArcGIS 10.1平台和所有后续版本的一部分发布。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

自引率

0.00%

发文量

期刊最新文献

Location corroborations by mobile devices without traces Knowledge-based trajectory completion from sparse GPS samples Particle filter for real-time human mobility prediction following unprecedented disaster Pyspatiotemporalgeom: a python library for spatiotemporal types and operations Fast transportation network traversal with hyperedges: (industrial paper)