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

快速并发数据草图

Fast Concurrent Data Sketches

Arik Rinberg, Alexander Spiegelman, Edward Bortnikov, Eshcar Hillel, Idit Keidar, Lee Rhodes, Hadar Serviansky

摘要:

数据草图是对长数据流的近似简洁的总结。它们被广泛用于处理大量数据并实时回答有关数据的统计查询。现有的库生成草图的速度非常快,但不允许使用多线程并行创建草图或在构建草图时查询草图。我们提出了一个通用的方法来有效地并行化数据草图,同时边界的错误,这样的并行介绍。利用宽松的语义和强线性的概念,我们证明了我们的算法的正确性,并分析了它在两个特定的草图引起的错误。我们的实现了高的可扩展性,同时保持误差小。

英文摘要:

Data sketches are approximate succinct summaries of long streams. They are widely used for processing massive amounts of data and answering statistical queries about it in real-time. Existing libraries producing sketches are very fast, but do not allow parallelism for creating sketches using multiple threads or querying them while they are being built. We present a generic approach to parallelising data sketches efficiently, while bounding the error that such parallelism introduces. Utilising relaxed semantics and the notion of strong linearisability we prove our algorithm's correctness and analyse the error it induces in two specific sketches. Our implementation achieves high scalability while keeping the error small.

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

↑