arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.03028cs.DB
收藏

关系型DBMS的再考虑乐观算法

Reconsidering Optimistic Algorithms for Relational DBMS

Malcolm Crowe, Fritz Laux

摘要:

在DBKDA 2019上,我们证明了StrongDBMS具有简单但严格的乐观算法,在高并发情况下比主要的商业数据库管理系统(DBMS)提供更好的性能。演示令人信服,但没有充分分析其成功的原因。下文简要介绍了这些结果。在这篇简短的文章中,我们想讨论一下结果的原因。分析导致了对所有基于锁定的DBMS算法的强烈批评,并且基于这些结果,建议重新设计现有DBMS的时间并不奇怪。

英文摘要:

At DBKDA 2019, we demonstrated that StrongDBMS with simple but rigorous optimistic algorithms, provides better performance in situations of high concurrency than major commercial database management systems (DBMS). The demonstration was convincing but the reasons for its success were not fully analysed. There is a brief account of the results below. In this short contribution, we wish to discuss the reasons for the results. The analysis leads to a strong criticism of all DBMS algorithms based on locking, and based on these results, it is not fanciful to suggest that it is time to re-engineer existing DBMS.

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

↑