Volltext-Downloads (blau) und Frontdoor-Views (grau)
  • search hit 6 of 544
Back to Result List

Reconsidering optimistic algorithms for relational 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar

Statistics

frontdoor_oas
Metadaten
Name:Laux, Friedrich
Editor of HS Reutlingen:Laux, Friedrich
URN:urn:nbn:de:bsz:rt2-opus4-27875
URL:https://www.iaria.org/conferences2020/DBKDA20.html
ISBN:978-1-61208-790-0
Publisher:IARIA
Document Type:Conference Proceeding
Language:English
Year of Publication:2020
Tag:concurrency; optimistic; transactions
Pagenumber:4
First Page:27
Last Page:30
Dewey Decimal Classification:004 Informatik
Open Access:Ja
Licence (German):License Logo  Creative Commons - CC BY - Namensnennung 4.0 International