arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1611.06128cs.DB
收藏

附件:Radon -拓扑关系的快速发现

Annex: Radon - Rapid Discovery of Topological Relations

Mohamed Ahmed Sherif, Kevin Dreßler, Panayiotis Smeros, Axel-Cyrille Ngonga Ngomo

摘要:

包含地理空间资源的数据集越来越多地按照关联数据原则来表示。在过去的几年里,已经开发了几种用于发现RDF资源之间的链接的时间效率高的方法。然而,地理空间资源之间的拓扑关系的时间效率的发现一直很少受到关注。我们解决这一研究空白,提出氡,一种新的方法,快速计算地理空间资源之间的拓扑关系。我们的方法使用稀疏平铺索引结合最小包围盒,以减少拓扑关系的计算时间。我们在45个数据集和800多个实验中对Radon的运行时间进行了评估,结果表明,它在保持100%的F测量值的同时,性能优于最先进的3个数量级。此外,我们的实验表明,氡规模以及并行实施时。

英文摘要:

Datasets containing geo-spatial resources are increasingly being represented according to the Linked Data principles. Several time-efficient approaches for discovering links between RDF resources have been developed over the last years. However, the time-efficient discovery of topological relations between geospatial resources has been paid little attention to. We address this research gap by presenting Radon, a novel approach for the rapid computation of topological relations between geo-spatial resources. Our approach uses a sparse tiling index in combination with minimum bounding boxes to reduce the computation time of topological relations. Our evaluation of Radon's runtime on 45 datasets and in more than 800 experiments shows that it outperforms the state of the art by up to 3 orders of magnitude while maintaining an F-measure of 100%. Moreover, our experiments suggest that Radon scales up well when implemented in parallel.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑