图上递归查询的分布式计算
On the distributed evaluation of recursive queries over graphs
摘要：
诸如一阶逻辑（FO）和定点逻辑（FP）之类的逻辑形式主义非常适合以声明的方式表达分布式系统中所需的基本图形功能。我们表明，这些逻辑构成良好的抽象编程分布式系统作为一个整体，因为它们可以在一个完全分布式的方式进行评估，合理的复杂性上限。我们首先证明FO和FP可以用对数大小的消息的多项式数进行评估。然后，我们表明，（全球）的逻辑公式可以被翻译成规则程序描述的分布式系统的节点的本地行为，计算等价的结果。最后，我们介绍了这些逻辑，尽可能多地保留其分布式计算的本地片段，同时提供了丰富的网络功能的表达能力。我们证明，他们承认更严格的上限有界的消息数量有界的大小。最后，我们表明，本地片段的语义和复杂性被保存在本地一致的网络以及匿名网络，从而显示出所提出的本地逻辑形式主义的鲁棒性。
英文摘要：
Logical formalisms such as first-order logic (FO) and fixpoint logic (FP) are well suited to express in a declarative manner fundamental graph functionalities required in distributed systems. We show that these logics constitute good abstractions for programming distributed systems as a whole, since they can be evaluated in a fully distributed manner with reasonable complexity upper-bounds. We first prove that FO and FP can be evaluated with a polynomial number of messages of logarithmic size. We then show that the (global) logical formulas can be translated into rule programs describing the local behavior of the nodes of the distributed system, which compute equivalent results. Finally, we introduce local fragments of these logics, which preserve as much as possible the locality of their distributed computation, while offering a rich expressive power for networking functionalities. We prove that they admit tighter upper-bounds with bounded number of messages of bounded size. Finally, we show that the semantics and the complexity of the local fragments are preserved over locally consistent networks as well as anonymous networks, thus showing the robustness of the proposed local logical formalisms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
