Reconsidering optimistic algorithms for relational DBMS

Malcolm Crowe; Fritz Laux

Reconsidering optimistic algorithms for relational DBMS

Malcolm Crowe
, Fritz Laux

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

30 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 language	English
Title of host publication	Proceedings of The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications
Editors	Malcolm Crowe, Lisa Ehringler, Fritz Laux, Andreas Schmidt
Publisher	ThinkMind
Pages	27-30
Number of pages	4
ISBN (Electronic)	9781612087900
Publication status	Published - 27 Sept 2020
Event	The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications - Lisbon, Portugal Duration: 27 Sept 2020 → 1 Oct 2020 https://www.iaria.org/conferences2020/CameraDBKDA20.html

Conference

Conference	The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications
Abbreviated title	DBKDA 2020
Country/Territory	Portugal
City	Lisbon
Period	27/09/20 → 1/10/20
Internet address	https://www.iaria.org/conferences2020/CameraDBKDA20.html

Keywords

transactions
concurrency
optimistic

Access to Document

2020 04 01 Crowe Algorithms acceptedAccepted author manuscript, 193 KB

Cite this

@inproceedings{c694e22d885347649abe957c6a286bb5,

title = "Reconsidering optimistic algorithms for relational DBMS",

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.",

keywords = "transactions, concurrency, optimistic",

author = "Malcolm Crowe and Fritz Laux",

year = "2020",

month = sep,

day = "27",

language = "English",

pages = "27--30",

editor = "Malcolm Crowe and Lisa Ehringler and Fritz Laux and Andreas Schmidt",

booktitle = "Proceedings of The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications",

publisher = "ThinkMind",

address = "United States",

note = "The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications, DBKDA 2020 ; Conference date: 27-09-2020 Through 01-10-2020",

url = "https://www.iaria.org/conferences2020/CameraDBKDA20.html",

}

Crowe, M & Laux, F 2020, Reconsidering optimistic algorithms for relational DBMS. in M Crowe, L Ehringler, F Laux & A Schmidt (eds), Proceedings of The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications. ThinkMind, pp. 27-30, The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications, Lisbon, Portugal, 27/09/20.

Reconsidering optimistic algorithms for relational DBMS. / Crowe, Malcolm; Laux, Fritz.
Proceedings of The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications. ed. / Malcolm Crowe; Lisa Ehringler; Fritz Laux; Andreas Schmidt. ThinkMind, 2020. p. 27-30.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Reconsidering optimistic algorithms for relational DBMS

AU - Crowe, Malcolm

AU - Laux, Fritz

PY - 2020/9/27

Y1 - 2020/9/27

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 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.

AB - 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.

KW - transactions

KW - concurrency

KW - optimistic

M3 - Conference contribution

SP - 27

EP - 30

BT - Proceedings of The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications

A2 - Crowe, Malcolm

A2 - Ehringler, Lisa

A2 - Laux, Fritz

A2 - Schmidt, Andreas

PB - ThinkMind

T2 - The Twelfth International Conference on Advances in Databases, Knowledge, and Data Applications

Y2 - 27 September 2020 through 1 October 2020

ER -

Reconsidering optimistic algorithms for relational DBMS

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this