arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.08130cs.DB
收藏

用于保持来自SPARQL端点的结果为最新的计划刷新命令(扩展版)

Scheduling Refresh Queries for Keeping Results from a SPARQL Endpoint Up-to-Date (Extended Version)

Magnus Knuth, Olaf Hartig, Harald Sack

摘要:

许多数据集会随着时间的推移而变化。因此,缓存并重复使用从SPARQL端点获得的查询结果的长时间运行的应用程序可能会定期重新提交查询,以确保结果的最新性。虽然如果这种定期刷新查询的数量是可管理的,则这种方法可能是可行的,但是随着越来越多的应用程序采用这种方法,SPARQL端点可能会因这种刷新查询而过载。一种更具可伸缩性的方法是使用一个中间件组件,应用程序在该组件上注册其查询,并在结果发生变化时获得更新的查询结果的通知。然后,该中间件可以调度刷新查询的重复执行,而不会使端点过载。在本文中,我们研究了大量的注册查询的调度刷新查询的问题,通过假设一个过载避免上限的长度可用于测试刷新查询的常规时隙。我们调查了各种调度策略,并比较他们的实验中所需的时隙之前,他们认识到的变化和数量的变化,他们错过了。

英文摘要:

Many datasets change over time. As a consequence, long-running applications that cache and repeatedly use query results obtained from a SPARQL endpoint may resubmit the queries regularly to ensure up-to-dateness of the results. While this approach may be feasible if the number of such regular refresh queries is manageable, with an increasing number of applications adopting this approach, the SPARQL endpoint may become overloaded with such refresh queries. A more scalable approach would be to use a middle-ware component at which the applications register their queries and get notified with updated query results once the results have changed. Then, this middle-ware can schedule the repeated execution of the refresh queries without overloading the endpoint. In this paper, we study the problem of scheduling refresh queries for a large number of registered queries by assuming an overload-avoiding upper bound on the length of a regular time slot available for testing refresh queries. We investigate a variety of scheduling strategies and compare them experimentally in terms of time slots needed before they recognize changes and number of changes that they miss.

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

↑