基于递归内容相关叠瓦的可扩展字符串协调
Scalable String Reconciliation by Recursive Content-Dependent Shingling
摘要：
我们考虑的问题，调和类似的，但远程，字符串与最小的通信复杂性。这个“字符串协调”问题是各种网络应用程序的基本构建块，包括那些维护大规模分布式网络和执行远程文件同步的应用程序。我们提出了一种新的递归内容相关的搭叠（RCDS）协议，该协议在计算上适用于大型字符串，并与远程字符串之间的编辑距离呈线性关系。我们提供了Rsync的性能比较，Rsync是最流行的文件同步工具之一。我们的实验表明，在最小的工程量下，RCDS在协调GitHub上5000个顶级星级git存储库中约51%的发布版本方面优于经过大量优化的Rsync。这种改进对于那些频繁但很小的更新的存储库来说尤其明显。
英文摘要：
We consider the problem of reconciling similar, but remote, strings with minimum communication complexity. This "string reconciliation" problem is a fundamental building block for a variety of networking applications, including those that maintain large-scale distributed networks and perform remote file synchronization. We present the novel Recursive Content-Dependent Shingling (RCDS) protocol that is computationally practical for large strings and scales linearly with the edit distance between the remote strings. We provide comparisons to the performance of Rsync, one of the most popular file synchronization tools in active use. Our experiments show that, with minimal engineering, RCDS outperforms the heavily optimized Rsync in reconciling release revisions for about 51% of the 5000 top starred git repositories on GitHub. The improvement is particularly evident for repositories that see frequent, but small, updates.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
