TY  - CHAP
U1  - Konferenzveröffentlichung
A1  - Crowe, Malcolm
A1  - Laux, Fritz
T1  - Reconsidering optimistic algorithms for relational DBMS
T2  - DBKDA 2020: The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications
N2  - 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.
KW  - transactions
KW  - concurrency
KW  - optimistic
Y1  - 2020
U6  - https://nbn-resolving.org/urn:nbn:de:bsz:rt2-opus4-27875
UN  - https://nbn-resolving.org/urn:nbn:de:bsz:rt2-opus4-27875
UR  - https://www.iaria.org/conferences2020/DBKDA20.html
SN  - 978-1-61208-790-0
SB  - 978-1-61208-790-0
SP  - 27
EP  - 30
S1  - 4
PB  - IARIA
ER  -