Reconsidering optimistic algorithms for relational DBMS

Malcolm Crowe, Fritz Laux

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Downloads (Pure)

Abstract

At DBKDA 2019, we demonstrated that StrongDBMS with simple but rigorous optimistic algorithms, provides better performance in situations of high
concurrency than major commercial 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 systems.
Original languageEnglish
Title of host publicationProceedings of The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications
Publication statusAccepted/In press - 1 Apr 2020
EventThe Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications - Lisbon, Portugal
Duration: 27 Sep 20201 Oct 2020
https://www.iaria.org/conferences2020/CameraDBKDA20.html

Conference

ConferenceThe Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications
Abbreviated titleDBKDA 2020
Country/TerritoryPortugal
CityLisbon
Period27/09/201/10/20
Internet address

Keywords

  • transactions
  • concurrency
  • optimistic

Fingerprint

Dive into the research topics of 'Reconsidering optimistic algorithms for relational DBMS'. Together they form a unique fingerprint.

Cite this