arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.09686cs.DScs.DC
收藏

目录协调

Directory Reconciliation

Michael Mitzenmacher, Tom Morgan

摘要:

我们开始的理论研究目录和解,概括的文件交换,其中爱丽丝和鲍勃每个人都有不同版本的一组文件,他们希望同步。这个问题被设计来捕获同步不同版本的文件目录的设置,同时允许在没有显著开销的情况下更改文件名和位置。我们提出的协议,有效地解决目录和解的基础上减少文件交换下编辑距离块移动,以及协议相结合的技术,用于协调集的文件交换协议。在此过程中,我们开发了一个新的协议,用于文件交换下的编辑距离块移动的启发,在图中的嘈杂的二进制搜索,它只使用$O(k \log n)$位的通信的代价是$O(k \log n)$轮的通信。

英文摘要:

We initiate the theoretical study of directory reconciliation, a generalization of document exchange, in which Alice and Bob each have different versions of a set of documents that they wish to synchronize. This problem is designed to capture the setting of synchronizing different versions of file directories, while allowing for changes of file names and locations without significant expense. We present protocols for efficiently solving directory reconciliation based on a reduction to document exchange under edit distance with block moves, as well as protocols combining techniques for reconciling sets of sets with document exchange protocols. Along the way, we develop a new protocol for document exchange under edit distance with block moves inspired by noisy binary search in graphs, which uses only $O(k \log n)$ bits of communication at the expense of $O(k \log n)$ rounds of communication.

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

↑