代数文件同步：同步性与完全性
Algebraic File Synchronization: Adequacy and Completeness
摘要：
随着分布式计算和移动应用的发展，数据结构的不同副本的同步问题越来越普遍。我们使用代数方法来推理文件系统操作，并介绍了一个简化的定义冲突的文件系统更新。我们还定义了更新检测和和解算法，并提出严格的证明，他们不仅按预期的工作，但也不能得到改善。为了实现这一目标，我们引入了一种新的，对称的一组文件系统命令具有更高的信息含量，删除边缘情况下，增加我们的代数模型的预测能力。我们还提出了一些一般有用的类和命令序列的属性。虽然这些结果通常是直观的，但为它们提供精确的证明绝非易事。它们有助于我们理解这种特殊类型的代数模型，并朝着建立更完整的代数文件系统树和扩展代数方法，以其他数据存储协议。它们还形成了一个理论基础，用于指定和保证实现代数同步方法的应用程序的无错误操作。
英文摘要：
With distributed computing and mobile applications, synchronizing diverging replicas of data structures is a more and more common problem. We use algebraic methods to reason about filesystem operations, and introduce a simplified definition of conflicting updates to filesystems. We also define algorithms for update detection and reconciliation and present rigorous proofs that they not only work as intended, but also cannot be improved on. To achieve this, we introduce a novel, symmetric set of filesystem commands with higher information content, which removes edge cases and increases the predictive powers of our algebraic model. We also present a number of generally useful classes and properties of sequences of commands. While these results are often intuitive, providing exact proofs for them is far from trivial. They contribute to our understanding of this special type of algebraic model, and toward building more complete algebras of filesystem trees and extending algebraic approaches to other data storage protocols. They also form a theoretical basis for specifying and guaranteeing the error-free operation of applications that implement an algebraic approach to synchronization.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
