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

基于SPARQL的链路流量执行代价估计

Estimating the Cost of Executing Link Traversal based SPARQL Queries

Antonis Sklavos, Pavlos Fafalios, Yannis Tzitzikas

摘要:

几乎所有领域的越来越多的组织都开始采用语义Web技术,将其数据发布为开放、链接和互操作(RDF)数据集,可通过SPARQL语言和协议进行查询。链接遍历已经成为一种SPARQL查询处理方法,它利用链接数据原则和Web的动态特性,通过在查询评估期间解析在线资源(URI)来动态地发现与回答查询相关的数据。然而,链接遍历查询的执行时间对于某些查询类型可能变得过高,这是由于在查询执行期间需要访问大量资源。在本文中,我们提出并评估基线方法估计的链接遍历查询的评估成本。这样的方法对于即时决定给定查询所遵循的查询执行策略非常有用,从而减少SPARQL端点的负载并提高查询服务的整体可靠性。为了评估所提出的方法的性能,我们创建了(并公开提供)一个由2,425个查询组成的地面实况数据集。

英文摘要:

An increasing number of organisations in almost all fields have started adopting semantic web technologies for publishing their data as open, linked and interoperable (RDF) datasets, queryable through the SPARQL language and protocol. Link traversal has emerged as a SPARQL query processing method that exploits the Linked Data principles and the dynamic nature of the Web to dynamically discover data relevant for answering a query by resolving online resources (URIs) during query evaluation. However, the execution time of link traversal queries can become prohibitively high for certain query types due to the high number of resources that need to be accessed during query execution. In this paper we propose and evaluate baseline methods for estimating the evaluation cost of link traversal queries. Such methods can be very useful for deciding on-the-fly the query execution strategy to follow for a given query, thereby reducing the load of a SPARQL endpoint and increasing the overall reliability of the query service. To evaluate the performance of the proposed methods, we have created (and make publicly available) a ground truth dataset consisting of 2,425 queries.

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

↑