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.
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 |
Keywords
- transactions
- concurrency
- optimistic