Minuet:一种可扩展的分布式多版本B树
Minuet: A Scalable Distributed Multiversion B-Tree
摘要:
传统上,数据管理系统被设计为支持长时间运行的分析查询或短时间的事务,但越来越多的应用程序需要两者。例如,在线游戏、社交移动应用和电子商务网站不仅需要维护运行状态,还需要快速分析数据,以做出预测和建议,从而改善用户体验。在本文中,我们提出了Minuet,一个分布式的,主存B树,支持事务和写时复制快照的原位分析。Minuet使用主存存储来实现低延迟的事务操作以及分析查询,而不会影响事务性能。除了支持快照上的只读分析查询外,Minuet还支持可写克隆,以便用户可以创建数据的分支版本。此功能可能非常有用,例如支持复杂的“假设”分析或促进广域复制。我们的实验表明,Minuet优于商业主存数据库在许多方面。它可以扩展到数百个内核和TB的内存,每秒可以处理数十万个B树操作,同时执行长时间运行的扫描。
英文摘要:
Data management systems have traditionally been designed to support either long-running analytics queries or short-lived transactions, but an increasing number of applications need both. For example, online games, socio-mobile apps, and e-commerce sites need to not only maintain operational state, but also analyze that data quickly to make predictions and recommendations that improve user experience. In this paper, we present Minuet, a distributed, main-memory B-tree that supports both transactions and copy-on-write snapshots for in-situ analytics. Minuet uses main-memory storage to enable low-latency transactional operations as well as analytics queries without compromising transaction performance. In addition to supporting read-only analytics queries on snapshots, Minuet supports writable clones, so that users can create branching versions of the data. This feature can be quite useful, e.g. to support complex "what-if" analysis or to facilitate wide-area replication. Our experiments show that Minuet outperforms a commercial main-memory database in many ways. It scales to hundreds of cores and TBs of memory, and can process hundreds of thousands of B-tree operations per second while executing long-running scans.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。