Volltext-Downloads (blau) und Frontdoor-Views (grau)
The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 57 of 625
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


Author of HS ReutlingenLaux, Friedrich
Editor of HS Reutlingen:Laux, Friedrich
Document Type:Conference Proceeding
Year of Publication:2020
Tag:concurrency; optimistic; transactions
Page Number:4
First Page:27
Last Page:30
DDC classes:004 Informatik
Open Access?:Ja
Licence (German):License Logo  Open Access