arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.0229cs.LOcs.NIcs.PL
收藏

关联数据的一个可验证代数

A Verified Algebra for Linked Data

Ross Horne, Vladimiro Sassone

摘要:

为松散结构数据在Web上的应用奠定了基础。由于在数据中使用URI来建立链接,该领域通常被称为关联数据。这项工作的重点是新兴的W3C标准,指定查询语言的关联数据。该方法是提供一个抽象的语法来捕获链接的数据结构和查询,然后将其内在化在一个进程演算中。演算的操作语义指定查询、数据和进程如何交互。一个标记的过渡系统被证明是健全的相对于操作语义。利用标号迁移系统上的互模拟来验证查询上的代数。导出代数是对应用领域的一个贡献。例如,代数可以用于重写查询以优化其在服务器集群上的分布。用于提供操作语义的框架足够强大,可以为Web建模相关演算。

英文摘要:

A foundation is investigated for the application of loosely structured data on the Web. This area is often referred to as Linked Data, due to the use of URIs in data to establish links. This work focuses on emerging W3C standards which specify query languages for Linked Data. The approach is to provide an abstract syntax to capture Linked Data structures and queries, which are then internalised in a process calculus. An operational semantics for the calculus specifies how queries, data and processes interact. A labelled transition system is shown to be sound with respect to the operational semantics. Bisimulation over the labelled transition system is used to verify an algebra over queries. The derived algebra is a contribution to the application domain. For instance, the algebra may be used to rewrite a query to optimise its distribution across a cluster of servers. The framework used to provide the operational semantics is powerful enough to model related calculi for the Web.

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

↑