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

多版本并发控制中视图鲁棒性与冲突鲁棒性何时一致

When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control

Brecht Vandevoort, Bas Ketsman, Frank Neven

AI总结:

本文研究了多版本并发控制中的视图鲁棒性问题,为隔离级别提供了使冲突鲁棒性与视图鲁棒性一致的充分条件,并证明在RC、SI和SSI下判定视图可串行化仍是NP完全的。

摘要:

DBMS允许通过分配严格弱于可串行化的隔离级别来以一致性换取效率。鲁棒性问题询问,对于给定的事务集合和给定的隔离级别分配,在所提供的分配下允许的这些事务的每一种可能的交错执行是否总是安全的。在文献中,安全被解释为冲突可串行化(我们在本文中将其称为冲突鲁棒性)。在本文中,我们研究了视图鲁棒性问题,将安全解释为视图可串行化。视图可串行化是一个更宽松的概念,它允许更多的调度是可串行化的,并且更紧密地契合了关于数据库一致性的直观理解。然而,视图可串行化分析起来更复杂(例如,冲突可串行化可以在多项式时间内判定,而判定视图可串行化是NP完全的)。虽然冲突鲁棒性蕴含视图鲁棒性,但反之一般不成立。在本文中,我们为隔离级别提供了一个充分条件,保证冲突鲁棒性和视图鲁棒性一致,并表明Postgres和Oracle中出现的隔离级别满足该条件:读已提交(RC)、快照隔离(SI)和可串行化快照隔离(SSI)。因此得出,对于这些系统,从冲突可串行化扩展到视图可串行化不允许更多的事务集合变得鲁棒。有趣的是,在这些隔离级别内判定可串行性的复杂性仍然大不相同。实际上,判定RC和SI下允许的调度的冲突可串行化仍处于多项式时间内,而我们表明在这些隔离级别内判定视图可串行化仍然是NP完全的。

英文摘要:

A DBMS allows trading consistency for efficiency through the allocation of isolation levels that are strictly weaker than serializability. The robustness problem asks whether, for a given set of transactions and a given allocation of isolation levels, every possible interleaved execution of those transactions that is allowed under the provided allocation, is always safe. In the literature, safe is interpreted as conflict-serializable (to which we refer here as conflict-robustness). In this paper, we study the view-robustness problem, interpreting safe as view-serializable. View-serializability is a more permissive notion that allows for a greater number of schedules to be serializable and aligns more closely with the intuitive understanding of what it means for a database to be consistent. However, view-serializability is more complex to analyze (e.g., conflict-serializability can be decided in polynomial time whereas deciding view-serializability is NP-complete). While conflict-robustness implies view-robustness, the converse does not hold in general. In this paper, we provide a sufficient condition for isolation levels guaranteeing that conflict- and view-robustness coincide and show that this condition is satisfied by the isolation levels occurring in Postgres and Oracle: read committed (RC), snapshot isolation (SI) and serializable snapshot isolation (SSI). It hence follows that for these systems, widening from conflict- to view-serializability does not allow for more sets of transactions to become robust. Interestingly, the complexity of deciding serializability within these isolation levels is still quite different. Indeed, deciding conflict-serializability for schedules allowed under RC and SI remains in polynomial time, while we show that deciding view-serializability within these isolation levels remains NP-complete.

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

↑